Some Easy Postoptimality Analysis for Zero-One Programming

DOI10.1287/MNSC.22.7.759MaRDI QIDQ4090129zbMATH OpenOpenAlexFDO

Authors Christopher J. Piper, Andris A. Zoltners

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(14)

• 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
• 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

This page was built for publication: Some Easy Postoptimality Analysis for Zero-One Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090129)