Implicit enumeration based algorithms for postoptimizing zero-one programs

DOI10.1002/nav.3800220413zbMath0354.90057OpenAlexW1982814648MaRDI QIDQ4126056

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)

Related Items (17)

Unnamed Item ⋮ Parametric methods in integer linear programming ⋮ An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Parametric uncapacitated facility location ⋮ 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 ⋮ Parametric-objective integer programming using knapsack facets and Gomory cutting planes ⋮ The value function of a mixed integer program: I ⋮ Discrete right hand side parametrization for linear integer programs ⋮ Sensitivity analysis of the optimal assignment. ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A contraction for the multiparametric integer linear programming problem ⋮ Solution of a parametric integer programming problem ⋮ 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