Pages that link to "Item:Q3706845"
From MaRDI portal
The following pages link to Sensitivity Analysis for Branch and Bound Integer Programming (Q3706845):
Displaying 21 items.
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- Using intervals for global sensitivity and worst-case analyses in multiattribute value trees (Q858356) (← links)
- Sensitivity analysis of mixed integer programs: An application to environmental policy making (Q1061616) (← links)
- Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075) (← links)
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717) (← links)
- L-shaped decomposition of two-stage stochastic programs with integer recourse (Q1290673) (← links)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Parametric methods in integer linear programming (Q2639777) (← links)
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems (Q2639778) (← links)
- Real-time personnel re-scheduling after a minor disruption in the retail industry (Q2664293) (← links)
- Postoptimal Analysis in Nonserial Dynamic Programming (Q3627708) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming (Q4530656) (← links)
- (Q4836359) (← links)
- (Q4983177) (← 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)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
- Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem (Q5906971) (← links)