A review of interactive methods for multiobjective integer and mixed-integer programming
From MaRDI portal
Publication:869154
DOI10.1016/J.EJOR.2006.02.033zbMATH Open1114.90074DBLPjournals/eor/AlvesC07OpenAlexW2039686757WikidataQ57664321 ScholiaQ57664321MaRDI QIDQ869154FDOQ869154
Authors: Maria João Alves, Joao Carlos Namorado Climaco 
Publication date: 26 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/5489
Recommendations
Multi-objective and goal programming (90C29) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A mathematical basis for satisficing decision making
- Title not available (Why is that?)
- Linear programming with multiple objective functions: Step method (stem)
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Title not available (Why is that?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Zero-one programming with multiple criteria
- An interactive procedure for multiple objective integer linear programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Solving zero-one multiple objective programs through implicit enumeration
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Linear multiple objective programs with zero–one variables
- Title not available (Why is that?)
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
- 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
- An Algorithm for Multiobjective Zero-One Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- An interactive method for bicriteria integer programming
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Title not available (Why is that?)
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- A pareto race
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Title not available (Why is that?)
- A branch and bound method for multi-objective Boolean problems
- A combined approach to solve binary multicriteria problems
- A multiple objective interactive Lagrangean relaxation approach
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- An interactive fuzzy satisfying method for large scale multiobjective 0-1 programming problems with fuzzy parameters through genetic algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (40)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Multi-objective due-date setting in a make-to-order environment
- An interactive algorithm for multiple criteria constrained sorting problem
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Solving the Multiple Objective Integer Linear Programming Problem
- Scalarizing fuzzy multi-objective linear fractional programming with application
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
- An interactive algorithm for deciding multi-criteria weights in incomplete information environment
- Disruption management in vehicle routing and scheduling for road freight transport: a review
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- Fair resource allocation: using welfare-based dominance constraints
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Solution approaches for equitable multiobjective integer programming problems
- Multi-level integer programming problem with multiple objectives at each level
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Biobjective robust optimization over the efficient set for Pareto set reduction
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Monolithic versus hierarchical approach to integrated scheduling in a supply chain
- Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Computing multiobjective Markov chains handled by the extraproximal method
- Title not available (Why is that?)
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- 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
- A note on a decision support system for multiobjective integer and mixed-integer programming problems.
- Solution of preemptive multi-objective network design problems applying Benders decomposition method
- A decomposition based minimax regret approach for inverse multiple criteria sorting problem
- An interactive possibilistic programming approach for a multi-objective closed-loop supply chain network under uncertainty
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem
- Refining analytic approximation based estimation of mixed multinomial probit models by parameter selection
- An interactive approximation algorithm for multi-objective integer programs
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- An algorithm for optimizing a linear function over an integer efficient set
This page was built for publication: A review of interactive methods for multiobjective integer and mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869154)
