An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

DOI10.1051/ro:2006004zbMath1169.90463OpenAlexW2138984903MaRDI QIDQ5439391

Alejandro Crema, José Luis Quintero

Publication date: 11 February 2008

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

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

zbMATH Keywords

bottleneck problemmultiparametric programming0-1-integer programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)

Related Items (1)

An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function

Uses Software

• OSL

Cites Work

• Unnamed Item
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes
• A contraction for the multiparametric integer linear programming problem
• The bottleneck generalized assignment problem
• An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
• An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
• The multiparametric 0-1-integer linear programming problem: A unified approach
• Parametric methods in integer linear programming
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
• Parametric Mixed Integer Programming: An Application to Solid Waste Management
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1

This page was built for publication: An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function