A review of interactive methods for multiobjective integer and mixed-integer programming
From MaRDI portal
Publication:869154
DOI10.1016/j.ejor.2006.02.033zbMath1114.90074OpenAlexW2039686757WikidataQ57664321 ScholiaQ57664321MaRDI QIDQ869154
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
Integer programming (90C10) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An interactive algorithm for multiple criteria constrained sorting problem, Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics, An algorithm for optimizing a linear function over an integer efficient set, Biobjective robust optimization over the efficient set for Pareto set reduction, Solution approaches for equitable multiobjective integer programming problems, 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 bi-objective modeling approach applied to an urban semi-desirable facility location problem, Unnamed Item, A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising, Multiobjective integer nonlinear fractional programming problem: a cutting plane approach, Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem, A decomposition based minimax regret approach for inverse multiple criteria sorting problem, Solution of preemptive multi-objective network design problems applying Benders decomposition method, Computing multiobjective Markov chains handled by the extraproximal method, Fair resource allocation: using welfare-based dominance constraints, Fathoming rules for biobjective mixed integer linear programs: review and extensions, Disruption management in vehicle routing and scheduling for road freight transport: a review, A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems, An interactive possibilistic programming approach for a multi-objective closed-loop supply chain network under uncertainty, An interactive algorithm for deciding multi‐criteria weights in incomplete information environment, An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems, Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives, Multi-objective due-date setting in a make-to-order environment, Monolithic versus hierarchical approach to integrated scheduling in a supply chain, An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function, Solving the Multiple Objective Integer Linear Programming Problem, 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, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs, New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach, Scalarizing fuzzy multi-objective linear fractional programming with application, Cone contraction and reference point methods for multi-criteria mixed integer optimization
Cites Work
- A branch and bound method for multi-objective Boolean problems
- A multiple objective interactive Lagrangean relaxation approach
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- An algorithm for the bi-criterion integer programming problem
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Zero-one programming with multiple criteria
- A reference direction approach to multiple objective integer linear programming
- An algorithm for the multiple objective integer linear programming problem
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- An interactive fuzzy satisfying method for large scale multiobjective 0-1 programming problems with fuzzy parameters through genetic algorithms
- An interactive procedure for multiple objective integer linear programming problems
- An interactive algorithm for solving multiple objective integer linear programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Solving zero-one multiple objective programs through implicit enumeration
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
- A combined approach to solve binary multicriteria problems
- An Algorithm for Multiobjective Zero-One Linear Programming
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive method for bicriteria integer programming
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- A mathematical basis for satisficing decision making
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- A pareto race
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Linear multiple objective programs with zero–one variables
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Linear programming with multiple objective functions: Step method (stem)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
