Pages that link to "Item:Q4530656"
From MaRDI portal
The following pages link to Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming (Q4530656):
Displaying 9 items.
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
- Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Superadditive characterizations of pure integer programming feasibility (Q5963699) (← links)
