Network Models for Multiobjective Discrete Optimization
From MaRDI portal
Publication:5086002
DOI10.1287/IJOC.2021.1066OpenAlexW3215719342MaRDI QIDQ5086002FDOQ5086002
Authors:
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
Recommendations
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Boosting efficiency for computing the Pareto frontier on tree structured networks
- Network reoptimization procedures for multiobjective network problems
Cites Work
- Multi-objective integer programming: an improved recursive algorithm
- Graph-Based Algorithms for Boolean Function Manipulation
- Multicriteria dynamic programming with an application to the integer case
- Integer Programming Formulation of Traveling Salesman Problems
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- Diversity Maximization Approach for Multiobjective Optimization
- Solving a multiobjective traveling salesman problem by dynamic programming
- Multivalued decision diagrams for sequencing problems
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Generalized dynamic programming for multicriteria optimization
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- The multiobjective traveling salesman problem: A survey and a new approach
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Labeling algorithms for multiple objective integer knapsack problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A discussion of scalarization techniques for multiple objective integer programming
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- The \(L\)-shape search method for triobjective integer programming
- 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
- Finding all nondominated points of multi-objective integer programs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Title not available (Why is that?)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- 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
- On the representation of the search region in multi-objective optimization
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- The shortest path problem with two objective functions
- An improved algorithm for solving biobjective integer programs
- Linear multiple objective programs with zero–one variables
- Decision diagrams for optimization
- Decision diagrams and dynamic programming
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Multi-objective branch and bound
- Branch-and-bound for bi-objective integer programming
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A hybrid approach for biobjective optimization
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A tolerance function for the multiobjective set covering problem
- Dynamic programming and optimal control. Vol. 1.
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- 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
Cited In (4)
Uses Software
This page was built for publication: Network Models for Multiobjective Discrete Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086002)
