Search Results - Stochastic 0–1 integer non-linear programming
-
1
Managing product variety with mixed make-to-stock/make-to-order production strategy and guaranteed delivery time under stochastic demand
ISSN: 0360-8352, 1879-0550Published: Elsevier Ltd 01.09.2020Published in Computers & industrial engineering (01.09.2020)“…•Modification of cuts, search and branching strategy in Branch & Bound (B&B) method.•Solution of the stochastic 0…”
Get full text
Journal Article -
2
Integrating operations and marketing decisions to manage perishability risks with target minimum remaining shelf-life available to consumers
ISSN: 0360-8352Published: Elsevier Ltd 01.01.2022Published in Computers & industrial engineering (01.01.2022)“…•Maximum (Max) remaining shelf-life (RSL) depends on sequencing & capacity allocation.•Product demand decreases from its Max-RSL to a marketing decided minimum…”
Get full text
Journal Article -
3
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem
ISSN: 0305-0548, 1873-765X, 0305-0548Published: New York Elsevier Ltd 01.09.2022Published in Computers & operations research (01.09.2022)“…We consider a stochastic version of the 0–1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack…”
Get full text
Journal Article -
4
Reliability stochastic optimization for a series system with interval component reliability via genetic algorithm
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 01.04.2010Published in Applied mathematics and computation (01.04.2010)“… This problem can be formulated as a nonlinear integer programming problem of maximizing the overall system reliability under chance constraints due to resources…”
Get full text
Journal Article -
5
Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem
ISSN: 0305-0548Published: Elsevier Ltd 01.06.2025Published in Computers & operations research (01.06.2025)“…A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0…”
Get full text
Journal Article -
6
Linear formulation for the Maximum Expected Coverage Location Model with fractional coverage
ISSN: 2211-6923, 2211-6931Published: Elsevier Ltd 01.03.2016Published in Operations research for health care (01.03.2016)“… Straightforward adaption of the well-studied MEXCLP to allow for coverage probabilities results in a non-linear formulation in integer variables, limiting the size of instances that can be solved by the model…”
Get full text
Journal Article -
7
Optimization and Separation for Structured Submodular Functions with Constraints
ISBN: 9798263354640Published: ProQuest Dissertations & Theses 01.01.2015“… On the integer programming side, where the goal is to find an optimal solution, existing approaches tackle the nonlinearity usually by solving a continuous convex relaxation of the nonlinear function…”
Get full text
Dissertation -
8
Introduction to distribution logistics
ISBN: 0471750441, 9780471750444Published: Hoboken, New Jersey John Wiley 2007“…unique introduction to distribution logistics that focuses on both quantitative modeling and practical business issues Introduction to Distribution Logistics…”
Get full text
eBook Book

