Analyse de sensibilité pour les problèmes linéaires en variables 0-1

DOI10.1051/ro:2004002zbMath1092.90031OpenAlexW2099642335MaRDI QIDQ5479833

Babacar Thiongane, Gérard Plateau, Anass Nagih

Publication date: 11 July 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_4_291_0

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)

Related Items (3)

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes
• Parameterisation algorithms for the integer linear programs in binary variables
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
• A reoptimization algorithm for the shortest path problem with time windows
• Stability of an optimal schedule
• Discrete right hand side parametrization for linear integer programs
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions
• On the calculation of the stability radius of an optimal or an approximate schedule
• On the complexity of postoptimality analysis of \(0/1\) programs
• Calculation of stability radii for combinatorial optimization problems
• Sensitivity analysis of the economic lot-sizing problem
• The stability of the approximate Boolean minimization of a linear form
• Advances in sensitivity analysis and parametric programming
• Sensitivity analysis for knapsack problems: A negative result
• 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
• Some concepts of stability analysis in combinatorial optimization
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
• Parametric methods in integer linear programming
• Three methods for postoptimal analysis in integer linear programming
• Sensitivity Analysis for Branch and Bound Integer Programming
• Complexity of some parametric integer and network programming problems
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Steiner problem in networks: A survey
• Sensitivity theorems in integer linear programming
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Constructive Duality in Integer Programming
• 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
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Generalized Lagrange Multipliers in Integer Programming
• Postoptimality analysis in zero‐one programming by implicit enumeration

This page was built for publication: Analyse de sensibilité pour les problèmes linéaires en variables 0-1