Parameterisation algorithms for the integer linear programs in binary variables

DOI10.1016/0377-2217(84)90013-4zbMath0542.90063OpenAlexW2039167437MaRDI QIDQ795729

A. P. Muhlemann, Emmanuel Loukakis

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90013-4

zbMATH Keywords

postoptimality analysisComputational experienceparametric integer linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Boolean programming (90C09)

Related Items (9)

Parametric methods in integer linear programming ⋮ A shadow price in integer programming for management decision ⋮ An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem ⋮ Parametric uncapacitated facility location ⋮ Parametric-objective integer programming using knapsack facets and Gomory cutting planes ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A contraction for the multiparametric integer linear programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterisation algorithms for the integer linear programs in binary variables
• Parametric integer linear programming: A synthesis of branch and bound with cutting planes
• Discrete right hand side parametrization for linear integer programs
• Parametric Multicriteria Integer Programming
• Computational Complexity of Some Problems in Parametric Discrete Programming. I
• Parametric Integer Programming Analysis: A Contraction Approach
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems
• The value function of an integer program
• The Structure of Integer Programs under the Hermitian Normal Form
• Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
• Some Easy Postoptimality Analysis for Zero-One Programming
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• A hybrid approach to discrete mathematical programming
• Reporting computational experiments in mathematical programming
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Postoptimality analysis in zero‐one programming by implicit enumeration

This page was built for publication: Parameterisation algorithms for the integer linear programs in binary variables