Discrete right hand side parametrization for linear integer programs
From MaRDI portal
Publication:1249136
DOI10.1016/0377-2217(78)90123-6zbMath0384.90090OpenAlexW1990348031MaRDI QIDQ1249136
Publication date: 1978
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(78)90123-6
Related Items (10)
Parametric methods in integer linear programming ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Parametric uncapacitated facility location ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ 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 ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ Solution of a parametric integer programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ A branch-and-bound algorithm for 0-1 parametric mixed integer programming
Cites Work
- Integer Programming and Pricing
- 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
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Postoptimality analysis in zero‐one programming by implicit enumeration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Discrete right hand side parametrization for linear integer programs