Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
From MaRDI portal
Publication:4060730
Cited in
(15)- Parametric integer linear programming: A synthesis of branch and bound with cutting planes
- The value function of a mixed integer program: I
- Parametric methods in integer linear programming
- scientific article; zbMATH DE number 3557522 (Why is no real title available?)
- Structural approach to parametric analysis of an IP. On the case of the right-hand side
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes
- Parameterisation algorithms for the integer linear programs in binary variables
- Some concepts of stability analysis in combinatorial optimization
- Solution of a parametric integer programming problem
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Parametric uncapacitated facility location
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Discrete right hand side parametrization for linear integer programs
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Parametric nonlinear integer programming: The right-hand side case
This page was built for publication: Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060730)