An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
From MaRDI portal
Publication:1124717
DOI10.1016/S0377-2217(98)00132-5zbMath0942.90027MaRDI QIDQ1124717
Publication date: 20 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (3)
Average shadow price and equilibrium price: a case study of tradable pollution permit markets ⋮ The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price ⋮ An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterisation algorithms for the integer linear programs in binary variables
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming
- Parametric integer linear programming: A synthesis of branch and bound with cutting planes
- 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
- A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem
- Parametric methods in integer linear programming
- Three methods for postoptimal analysis in integer linear programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Sensitivity Analysis for Branch and Bound Integer Programming
- Sensitivity theorems in integer linear programming
- Parametric Integer Programming Analysis: A Contraction Approach
- Implicit enumeration based algorithms for postoptimizing zero-one programs
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
- Parametric Mixed Integer Programming: An Application to Solid Waste Management
- Postoptimality analysis in zero‐one programming by implicit enumeration
This page was built for publication: An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
