Network Models for Multiobjective Discrete Optimization
From MaRDI portal
Publication:5086002
DOI10.1287/ijoc.2021.1066OpenAlexW3215719342MaRDI QIDQ5086002
No author found.
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.08637
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- The \(L\)-shape search method for triobjective integer programming
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- On the representation of the search region in multi-objective optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Decision diagrams for optimization
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Finding all nondominated points of multi-objective integer programs
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Generalized dynamic programming for multicriteria optimization
- Solving efficiently the 0-1 multi-objective knapsack problem
- Labeling algorithms for multiple objective integer knapsack problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- The shortest path problem with two objective functions
- Multicriteria dynamic programming with an application to the integer case
- An algorithm for the multiple objective integer linear programming problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A hybrid approach for biobjective optimization
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A tolerance function for the multiobjective set covering problem
- Multi-objective branch and bound
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An improved algorithm for solving biobjective integer programs
- A discussion of scalarization techniques for multiple objective integer programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- 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
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Integer Programming Formulation of Traveling Salesman Problems
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- Diversity Maximization Approach for Multiobjective Optimization
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Graph-Based Algorithms for Boolean Function Manipulation
- Linear multiple objective programs with zero–one variables
- Solving a multiobjective traveling salesman problem by dynamic programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Decision Diagrams and Dynamic Programming
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
- Branch-and-Bound for Bi-objective Integer Programming
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- Multivalued Decision Diagrams for Sequencing Problems
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: Network Models for Multiobjective Discrete Optimization
