An improved version of the augmented -constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems

Cites Work

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?)
Title not available (Why is that?)
Title not available (Why is that?)
Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
Selection among ranked projects under segmentation, policy and logical constraints
Multi-objective optimization using evolutionary algorithms
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
A survey and annotated bibliography of multiobjective combinatorial optimization
A survey of recent developments in multiobjective optimization
A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
Improved \(\varepsilon\)-constraint method for multiobjective programming
Multi-objective integer programming: a general approach for generating all non-dominated solutions
Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
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
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
Finding representative systems for discrete bicriterion optimization problems
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
Multi‐objective combinatorial optimization problems: A survey
A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
An exact method for computing the nadir values in multiple objective linear programming
Computational experience concerning payoff tables and minimum criterion values over the efficient set
A review of interactive methods for multiobjective integer and mixed-integer programming
The multiobjective multidimensional knapsack problem: a survey and a new approach
Multi-directional local search
Zero-one programming with multiple criteria
An algorithm for optimizing a linear function over an integer efficient set
An improved algorithm for solving biobjective integer programs
Approximating Multiobjective Knapsack Problems
Theory and algorithms for linear multiple objective programs with zero–one variables
Linear multiple objective programs with zero–one variables
Constructing robust crew schedules with bicriteria optimization
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem

Cited In (54)

Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
Distribution based representative sets for multi-objective integer programs
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
Multi-objective decision method for airport landside rapid transit network design
Investigating of transportation systems development for urban districts, costs and social equity: a case of Sanandaj, Kurdistan
Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
A multi-criteria decision framework for sustainable supplier selection and order allocation using multi-objective optimization and fuzzy approach
Decision support models in climate policy
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
Advanced network connectivity features and zonal requirements in covering location problems
Dynamic programming algorithms for the bi-objective integer knapsack problem
Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy
Multi-objective evolutionary algorithms for a reliability location problem
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process
Multi-mode resource constrained project scheduling problem along with contractor selection
GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
Design of a heuristic algorithm for the generalized multi-objective set covering problem
An exact algorithm for biobjective mixed integer linear programming problems
A multi-objective mixed integer linear programming model for thesis defence scheduling
Solution approaches for equitable multiobjective integer programming problems
A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
A hybrid approach for biobjective optimization
An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method
Planning tank-truck hazardous materials shipments in intercity road transportation networks
A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
Efficient automated schematic map drawing using multiobjective mixed integer programming
An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain
A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem
An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
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
A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms
The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns
A multi-product model for evaluating and selecting two layers of suppliers considering environmental factors
Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model
Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
A data-driven optimization model to response to COVID-19 pandemic: a case study
Multi-objective optimization model for a downstream oil and gas supply chain
A multi-objective decision-making model for supplier selection considering transport discounts and supplier capacity constraints
Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
Column generation based solution for bi-objective gate assignment problems
Bi-objective model for the distribution of COVID-19 vaccines
Sustainable urban farming using a two-phase multi-objective and multi-criteria decision-making approach
An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem

Uses Software

PISA
GAMS
SPEA2

This page was built for publication: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016277)