Solution of a parametric integer programming problem
From MaRDI portal
Publication:3674401
Cites work
- scientific article; zbMATH DE number 3643057 (Why is no real title available?)
- scientific article; zbMATH DE number 3679539 (Why is no real title available?)
- scientific article; zbMATH DE number 3687459 (Why is no real title available?)
- scientific article; zbMATH DE number 3694963 (Why is no real title available?)
- scientific article; zbMATH DE number 3557522 (Why is no real title available?)
- scientific article; zbMATH DE number 3373542 (Why is no real title available?)
- Approximate solution of parametric integer programming problems
- Discrete right hand side parametrization for linear integer programs
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Implicit enumeration based algorithms for postoptimizing zero-one programs
- Integer Programming Post-Optimal Analysis with Cutting Planes
- Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
- Postoptimality analysis in zero‐one programming by implicit enumeration
- Some Easy Postoptimality Analysis for Zero-One Programming
Cited in
(5)- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Certain parametric problems of integer convex programming and their approximate solution
- Some concepts of stability analysis in combinatorial optimization
- Theoretical and algorithmic advances in multi-parametric programming and control
- Qualitative investigation of path problems
This page was built for publication: Solution of a parametric integer programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674401)
