Pages that link to "Item:Q688927"
From MaRDI portal
The following pages link to The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927):
Displayed 42 items.
- The stochastic location-assignment problem on a tree (Q816410) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- A generic stochastic model for supply-and-return network design (Q850288) (← links)
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- On a stochastic sequencing and scheduling problem (Q875406) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
- Stochastic vehicle routing (Q1266554) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- L-shaped decomposition of two-stage stochastic programs with integer recourse (Q1290673) (← links)
- On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. (Q1298755) (← links)
- Dual decomposition in stochastic integer programming (Q1306366) (← links)
- Stochastic programming with simple integer recourse (Q1315421) (← links)
- Decomposition methods in stochastic programming (Q1365061) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- Convex approximations for complete integer recourse models (Q1434075) (← links)
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
- Applying the minimax criterion in stochastic recourse programs (Q1771344) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- On the expected value function of a simple integer recourse problem with random technology matrix (Q1893961) (← links)
- On structure and stability in stochastic programs with random technology matrix and complete integer recourse (Q1904660) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
- A labeling method for dynamic driver-task assignment with uncertain task durations (Q2488239) (← links)
- Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming (Q2489277) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- A two-stage stochastic integer programming model for a thermal power system expansion (Q3158867) (← links)
- A selective newsvendor approach to order management (Q3612299) (← links)
- Two‐stage stochastic integer programming: a survey (Q4354859) (← links)
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
- Integrating operations research in constraint programming (Q5898341) (← links)
- Optimal facility location with random throughput costs (Q5959384) (← links)