Network Models for Multiobjective Discrete Optimization (Q5086002)

scientific article; zbMATH DE number 7551221

Language	Label	Description	Also known as
English	Network Models for Multiobjective Discrete Optimization	scientific article; zbMATH DE number 7551221

Statements

instance of

scholarly article

0 references

title

Network Models for Multiobjective Discrete Optimization (English)

0 references

published in

INFORMS Journal on Computing

0 references

publication date

30 June 2022

0 references

full work available at URL

https://arxiv.org/abs/1802.08637

0 references

zbMATH Keywords

decision analysis

0 references

multiple criteria

0 references

dynamic programming

0 references

generalized networks

0 references

integer programming

0 references

describes a project that uses

CPLEX

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

Disjunctive Programming for Multiobjective Discrete Optimisation

0 references

Decision diagrams for optimization

0 references

Q4597712

0 references

Linear multiple objective programs with zero–one variables

0 references

The \(L\)-shape search method for triobjective integer programming

0 references

A new method for optimizing a linear function over the efficient set of a multiobjective integer program

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

Solving bicriteria 0--1 knapsack problems using a labeling algorithm.

0 references

Generalized dynamic programming for multicriteria optimization

0 references

Multivalued Decision Diagrams for Sequencing Problems

0 references

A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems

0 references

Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming

0 references

A discussion of scalarization techniques for multiple objective integer programming

0 references

Labeling algorithms for multiple objective integer knapsack problems

0 references

Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem

0 references

Solving a multiobjective traveling salesman problem by dynamic programming

0 references

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems

0 references

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

0 references

A survey on multi-constrained optimal path computation: exact and approximate algorithms

0 references

On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

0 references

The shortest path problem with two objective functions

0 references

Decision Diagrams and Dynamic Programming

0 references

Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint

0 references

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

0 references

A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

0 references

Q4945108

0 references

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

0 references

An algorithm for the multiple objective integer linear programming problem

0 references

An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method

0 references

Finding all nondominated points of multi-objective integer programs

0 references

The Multiobjective Traveling Salesman Problem: A Survey and a New Approach

0 references

The multiobjective multidimensional knapsack problem: a survey and a new approach

0 references

Diversity Maximization Approach for Multiobjective Optimization

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

Integer Programming Formulation of Traveling Salesman Problems

0 references

Multi-objective integer programming: a general approach for generating all non-dominated solutions

0 references

Multi-objective integer programming: an improved recursive algorithm

0 references

Branch-and-Bound for Bi-objective Integer Programming

0 references

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method

0 references

Multiobjective Integer Programming: Synergistic Parallel Approaches

0 references

Multi-objective branch and bound

0 references

An improved algorithm for solving biobjective integer programs

0 references

Dynamic programming algorithms for the bi-objective integer knapsack problem

0 references

A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem

0 references

The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

0 references

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

0 references

An interactive weighted Tchebycheff procedure for multiple objective programming

0 references

A hybrid approach for biobjective optimization

0 references

A method for finding the set of non-dominated vectors for multiple objective integer linear programs

0 references

Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems

0 references

Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

0 references

A cutting-plane method to nonsmooth multiobjective optimization problems

0 references

Multicriteria dynamic programming with an application to the integer case

0 references

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

0 references

A tolerance function for the multiobjective set covering problem

0 references

Identifiers

DOI

10.1287/ijoc.2021.1066

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5086002