Pages that link to "Item:Q2781102"
From MaRDI portal
The following pages link to On optimal allocation of indivisibles under uncertainty (Q2781102):
Displaying 39 items.
- Efficient allocations under ambiguity (Q548260) (← links)
- Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
- On the efficiency and optimality of random allocations (Q761335) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- Reliability optimization of a complex system by the stochastic branch and bound method (Q946784) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- A branch and bound method for stochastic global optimization (Q1290672) (← links)
- Convex approximations for complete integer recourse models (Q1434075) (← links)
- Managing congestion in a multi-modal transportation network under biomass supply uncertainty (Q1730690) (← links)
- Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years (Q1787914) (← links)
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound (Q1847179) (← links)
- A mechanism of effective allocation of resources of a bank under conditions of probabilistic uncertainty (Q1883750) (← links)
- Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand (Q1926991) (← links)
- Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
- Stochastic global optimization using tangent minorants for Lipschitz functions (Q1989202) (← links)
- Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
- On the optimality of not allocating (Q2345151) (← links)
- Enriched workflow modelling and stochastic branch-and-bound (Q2433552) (← links)
- Probabilistic assignment of indivisible goods with single-peaked preferences (Q2453443) (← links)
- A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← 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)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Minorant methods of stochastic global optimization (Q2577236) (← links)
- (Q3115573) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- On the role of bounds in stochastic linear programming (Q4484947) (← links)
- Optimal allocation with costly inspection and discrete types under ambiguity (Q4594827) (← links)
- Discrete stochastic optimization using variants of the stochastic ruler method (Q4680429) (← links)
- HOW TO COPE WITH DIVISION PROBLEMS UNDER INTERVAL UNCERTAINTY OF CLAIMS? (Q4824652) (← links)
- A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities (Q4995106) (← links)
- Stochastic multi-objective optimization: a survey on non-scalarizing methods (Q5963107) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- Winner determination with sustainable-flexible considerations under demand uncertainty in transportation service procurement auctions (Q6146888) (← links)
- Two-stage stochastic nonlinear winner determination for logistics service procurement auctions under quantity discounts (Q6175327) (← links)
