Bound sets for biobjective combinatorial optimization problems
From MaRDI portal
Publication:875413
DOI10.1016/J.COR.2005.10.003zbMATH Open1141.90509OpenAlexW1968876856MaRDI QIDQ875413FDOQ875413
Matthias Ehrgott, Xavier Gandibleux
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.003
Recommendations
- scientific article; zbMATH DE number 1784662
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Lower bound sets for biobjective shortest path problems
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
Cites Work
- Theory of multiobjective optimization
- Multicriteria dynamic programming with an application to the integer case
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Title not available (Why is that?)
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- A combined approach to solve binary multicriteria problems
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
Cited In (65)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- B{\&}B method for discrete partial order optimization
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- On upper approximations of Pareto fronts
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Advancements in the computation of enclosures for multi-objective optimization problems
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Preprocessing and cut generation techniques for multi-objective binary programming
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Bi-objective design-for-control of water distribution networks with global bounds
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Cooperative multiobjective optimization with bounds on objective functions
- Branch-and-Bound for Bi-objective Integer Programming
- Title not available (Why is that?)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- On the representation of the search region in multi-objective optimization
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Choquet optimal set in biobjective combinatorial optimization
- Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Split algorithms for multiobjective integer programming problems
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Lower bound sets for biobjective shortest path problems
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- Branch-and-bound and objective branching with three or more objectives
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Multi-objective branch and bound
- A supply chain design problem with facility location and bi-objective transportation choices
- An algorithm for solving the bi-objective median path-shaped facility on a tree network
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- Bi-objective optimisation over a set of convex sub-problems
- Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- The hiking tourist problem
- Limit sets in global multiobjective optimization
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Relaxations and duality for multiobjective integer programming
- A matheuristic for tri-objective binary integer linear programming
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Augmenting bi-objective branch and bound by scalarization-based information
- A simple method for approximating a general Pareto surface
Uses Software
This page was built for publication: Bound sets for biobjective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875413)
