Solution of a parametric integer programming problem

DOI10.1007/BF01069764zbMath0523.90066OpenAlexW2002867736MaRDI QIDQ3674401

L. N. Kozeratskaya, Ivan V. Sergienko

Publication date: 1982

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01069764

zbMATH Keywords

integer linear programmingapproximate algorithmparametric constraintdirected neighborhoods method

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (5)

Certain parametric problems of integer convex programming and their approximate solution ⋮ Theoretical and algorithmic advances in multi-parametric programming and control ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Qualitative investigation of path problems ⋮ Some concepts of stability analysis in combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete right hand side parametrization for linear integer programs
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Approximate solution of parametric integer programming problems
• 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
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Postoptimality analysis in zero‐one programming by implicit enumeration

This page was built for publication: Solution of a parametric integer programming problem