Multi-objective branch and bound (Q1753506)

From MaRDI portal

Revision as of 18:13, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multi-objective branch and bound	scientific article

Statements

scholarly article

0 references

Multi-objective branch and bound (English)

0 references

Anthony Przybylski

0 references

Xavier Gandibleux

0 references

European Journal of Operational Research

0 references

publication date

29 May 2018

0 references

zbMATH Keywords

multiple objective programming

0 references

branch and bound

0 references

bound sets

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2017.01.032

0 references

Bicriteria Transportation Problem

0 references

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method

0 references

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

0 references

Multiobjective programming and planning

0 references

0 references

Covering Pareto sets by multilevel subdivision techniques

0 references

Multicriteria Optimization

0 references

A survey and annotated bibliography of multiobjective combinatorial optimization

0 references

0 references

Bound sets for biobjective combinatorial optimization problems

0 references

Computation of ideal and Nadir values and implications for their use in MCDM methods.

0 references

Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

0 references

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

0 references

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

0 references

Parallel Branch-and-Branch Algorithms: Survey and Synthesis

0 references

0 references

0 references

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

0 references

0 references

Computing the nadir point for multiobjective discrete optimization problems

0 references

An Algorithm for Multiobjective Zero-One Linear Programming

0 references

On the representation of the search region in multi-objective optimization

0 references

Finding nadir points in multi-objective integer programs

0 references

0 references

A branch and bound algorithm for mixed zero-one multiple objective linear programming

0 references

Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming

0 references

0 references

An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs

0 references

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

0 references

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

0 references

The problem of the optimal biobjective spanning tree

0 references

Exact hybrid algorithms for solving a bi-objective vehicle routing problem

0 references

Constraint Optimization Techniques for Exact Multi-Objective Optimization

0 references

Dynamic programming algorithms for the bi-objective integer knapsack problem

0 references

Approximation methods in multiobjective programming

0 references

The multicriteria big cube small cube method

0 references

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

0 references

Multiobjective optimization. Interactive and evolutionary approaches

0 references

0 references

Multicriteria integer programming: A (hybrid) dynamic programming recursive approach

0 references

Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case

0 references

Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2017.01.032

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1753506

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1753506&oldid=36393893"