Parametric-objective integer programming using knapsack facets and Gomory cutting planes
DOI10.1016/0377-2217(87)90143-3zbMATH Open0624.90072OpenAlexW2068279233MaRDI QIDQ579128FDOQ579128
Authors: Larry Jenkins 
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90143-3
Recommendations
cutting planere-optimizationComputational resultsknapsack facetsparametric integer programspost-optimal analysis
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Solving Large-Scale Zero-One Linear Programming Problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Parametric Mixed Integer Programming: An Application to Solid Waste Management
- Postoptimality analysis in zero‐one programming by implicit enumeration
- Integer Programming Post-Optimal Analysis with Cutting Planes
- Title not available (Why is that?)
- 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
- Development of a Parametric Generating Procedure for Integer Programming Test Problems
- Title not available (Why is that?)
- Parameterisation algorithms for the integer linear programs in binary variables
Cited In (10)
- Parametric methods in integer linear programming
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
- The multiparametric 0-1-integer linear programming problem: A unified approach
- Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
- A computational comparison of Gomory and knapsack cuts
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Uses Software
This page was built for publication: Parametric-objective integer programming using knapsack facets and Gomory cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579128)
