Solution of a parametric integer programming problem
From MaRDI portal
Publication:3674401
DOI10.1007/BF01069764zbMATH Open0523.90066OpenAlexW2002867736MaRDI QIDQ3674401FDOQ3674401
L. N. Kozeratskaya, I. V. Sergienko
Publication date: 1982
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01069764
Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)
Cites Work
- Approximate solution of parametric integer programming problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Postoptimality analysis in zero‐one programming by implicit enumeration
- Title not available (Why is that?)
- Integer Programming Post-Optimal Analysis with Cutting Planes
- 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
- Discrete right hand side parametrization for linear integer programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Certain parametric problems of integer convex programming and their approximate solution
- Qualitative investigation of path problems
- Some concepts of stability analysis in combinatorial optimization
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Theoretical and algorithmic advances in multi-parametric programming and control
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)
