Some Easy Postoptimality Analysis for Zero-One Programming
From MaRDI portal
Publication:4090129
DOI10.1287/mnsc.22.7.759zbMath0325.90048MaRDI QIDQ4090129
Andris A. Zoltners, Christopher J. Piper
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.7.759
Related Items
Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Parametric-objective integer programming using knapsack facets and Gomory cutting planes, Parameterisation algorithms for the integer linear programs in binary variables, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual, Sensitivity analysis of mixed integer programs: An application to environmental policy making, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, Parametric nonlinear integer programming: The right-hand side case, Discrete right hand side parametrization for linear integer programs, Structural approach to parametric analysis of an IP. On the case of the right-hand side, Stability aspects of the traveling salesman problem based on \(k\)-best solutions, Parametric uncapacitated facility location, Parametric methods in integer linear programming, Stability, parametric, and postoptimality analysis of discrete optimization problems, Solution of a parametric integer programming problem
