An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
From MaRDI portal
Publication:1577993
DOI10.1016/S0377-2217(99)00183-6zbMath0969.90077WikidataQ57664333 ScholiaQ57664333MaRDI QIDQ1577993
Maria João Alves, Joao Carlos Namorado Climaco
Publication date: 19 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
sensitivity analysisbranch-and-boundmulti criteria analysisreference pointsmixed-integer linear programmingChebyshev metric
Related Items (26)
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An integrated approach for stock evaluation and portfolio optimization ⋮ An improved algorithm for solving biobjective integer programs ⋮ Graphical exploration of the weight space in three-objective mixed integer linear programs ⋮ Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Indifference sets of reference points in multi-objective integer linear programming ⋮ The multiscenario lot size problem with concave costs. ⋮ A note on a decision support system for multiobjective integer and mixed-integer programming problems. ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ محاسبه مرز کارای مدل دوسطحی خطی چندهدفه ⋮ Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A reference direction approach to multiple objective integer linear programming
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- A multiobjective approach to vendor selection
- An interactive procedure for multiple objective integer linear programming problems
- An interactive algorithm for solving multiple objective integer linear programming problems
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- On the interactive solution to a multicriteria scheduling problem
- Linear multiple objective programs with zero–one variables
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- An interactive weighted Tchebycheff procedure for multiple objective programming
This page was built for publication: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
