Implicit enumeration based algorithms for postoptimizing zero-one programs

DOI10.1002/NAV.3800220413MaRDI QIDQ4126056zbMATH OpenOpenAlexFDO

Authors Christopher J. Piper, Andris A. Zoltners

Publication date 1975

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800220413

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(17)

• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
• An algorithm for the multiple objective integer linear programming problem
• Parametric integer linear programming: A synthesis of branch and bound with cutting planes
• Parametric nonlinear integer programming: The right-hand side case
• The value function of a mixed integer program: I
• 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
• A contraction for the multiparametric integer linear programming problem
• Parametric uncapacitated facility location
• Sensitivity analysis of the optimal assignment.
• Parametric methods in integer linear programming
• Stability, parametric, and postoptimality analysis of discrete optimization problems
• Solution of a parametric integer programming problem
• scientific article; zbMATH DE number 3557522 (Why is no real title available?)
• 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

This page was built for publication: Implicit enumeration based algorithms for postoptimizing zero-one programs

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