An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
From MaRDI portal
Publication:1578554
DOI10.1016/S0377-2217(99)00193-9zbMATH Open0972.90049MaRDI QIDQ1578554FDOQ1578554
Authors: Alejandro Crema 
Publication date: 11 January 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- 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 algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A contraction for the multiparametric integer linear programming problem
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- Constructing the minimization diagram of a two-parameter problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
- Parametric Mixed Integer Programming: An Application to Solid Waste Management
- Parametric methods in integer linear programming
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes
- Three methods for postoptimal analysis in integer linear programming
- Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
Cited In (13)
- The multiparametric 0-1-integer linear programming problem: A unified approach
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
- Parameterisation algorithms for the integer linear programs in binary variables
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Title not available (Why is that?)
- A contraction for the multiparametric integer linear programming problem
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Min max min robust (relative) regret combinatorial optimization
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Uses Software
This page was built for publication: An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578554)
