On the strength of Lagrangian duality in multiobjective integer programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1094769 (Why is no real title available?)
- scientific article; zbMATH DE number 1530340 (Why is no real title available?)
- scientific article; zbMATH DE number 1784662 (Why is no real title available?)
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A discussion of scalarization techniques for multiple objective integer programming
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING
- About solving linear equations with real coefficients.
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An exact algorithm for biobjective mixed integer linear programming problems
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Bound sets for biobjective combinatorial optimization problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Finding representative systems for discrete bicriterion optimization problems
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Lower bound sets for biobjective shortest path problems
- Multicriteria Optimization
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- On the augmented Lagrangian dual for integer programming
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Relaxations and duality for multiobjective integer programming
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Theorie der einfachen Ungleichungen.
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
This page was built for publication: On the strength of Lagrangian duality in multiobjective integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962849)
