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-6zbMATH Open0969.90077DBLPjournals/eor/AlvesC00WikidataQ57664333 ScholiaQ57664333MaRDI QIDQ1577993FDOQ1577993
Authors: 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)
Recommendations
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- A reference direction approach to multiple objective integer linear programming
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- scientific article; zbMATH DE number 1086966
sensitivity analysisreference pointsbranch-and-boundmixed-integer linear programmingmulti criteria analysisChebyshev metric
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A multiobjective approach to vendor selection
- An interactive procedure for multiple objective integer linear programming problems
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Linear multiple objective programs with zero–one variables
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A reference direction approach to multiple objective integer linear programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Title not available (Why is that?)
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the interactive solution to a multicriteria scheduling problem
Cited In (31)
- An integrated approach for stock evaluation and portfolio optimization
- An improved algorithm for solving biobjective integer programs
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- A cyclic non-homogeneous Markov chain model for resource availability optimization in a two-parking lots system with priority classes and resource reservation
- Interactive multiobjective tabu/scatter search based on reference point
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Indifference sets of reference points in multi-objective integer linear programming
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management
- Cone contraction and reference point methods for multi-criteria mixed integer optimization
- 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
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- A note on a decision support system for multiobjective integer and mixed-integer programming problems.
- Title not available (Why is that?)
- Computing the Pareto frontier of a linear multiobjective bi-level model
- An interactive approximation algorithm for multi-objective integer programs
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
- The multiscenario lot size problem with concave costs.
This page was built for publication: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577993)
