Relaxations and duality for multiobjective integer programming

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Vector Optimization with Infimum and Supremum
Multicriteria Optimization
Proper efficiency and the theory of vector maximization
The Lagrangian Relaxation Method for Solving Integer Programming Problems
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
Two-phase Pareto local search for the biobjective traveling salesman problem
A discussion of scalarization techniques for multiple objective integer programming
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
Geometric Duality in Multiple Objective Linear Programming
Bicriteria Transportation Problem
Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
Bound sets for biobjective combinatorial optimization problems
Cutting-plane theory: Algebraic methods
A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
On some relations between a dual pair of multiple objective linear programs
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
Integer programming duality: Price functions and sensitivity analysis
Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
Duality theory for the matrix linear programming problem
A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
Saddle points and scalarizing sets in multiple objective linear programming
On duality in multiple objective linear programming
Set-valued duality theory for multiple objective linear programs and application to mathematical finance
Multiobjective Linear Programming
Efficient computation of the search region in multi-objective optimization
Lower bound sets for biobjective shortest path problems
Integer programming duality in multiple objective programming
Multi-objective branch and bound
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
A new method for optimizing a linear function over the efficient set of a multiobjective integer program

This page was built for publication: Relaxations and duality for multiobjective integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608043)