An improved version of the augmented -constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
From MaRDI portal
Publication:2016277
Recommendations
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective integer programming: an improved recursive algorithm
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1975101 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- scientific article; zbMATH DE number 3999655 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A survey of recent developments in multiobjective optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An algorithm for optimizing a linear function over an integer efficient set
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An exact method for computing the nadir values in multiple objective linear programming
- An improved algorithm for solving biobjective integer programs
- Approximating multiobjective knapsack problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Constructing robust crew schedules with bicriteria optimization
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Finding representative systems for discrete bicriterion optimization problems
- Improved -constraint method for multiobjective programming
- Linear multiple objective programs with zero–one variables
- Multi-directional local search
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective optimization using evolutionary algorithms
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Multi‐objective combinatorial optimization problems: A survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Selection among ranked projects under segmentation, policy and logical constraints
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Zero-one programming with multiple criteria
Cited in
(75)- A multi-objective decision-making model for supplier selection considering transport discounts and supplier capacity constraints
- Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation
- New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A multi-objective sustainable closed-loop supply chain network problem with hybrid facilities
- Distribution based representative sets for multi-objective integer programs
- A method to identify a representation of the set of non-dominated points for discrete tri-objective optimization problems
- Redesigning a NSGA-II metaheuristic for the bi-objective support vector machine with feature selection
- A branch-and-price algorithm for fast and equitable last-mile relief aid distribution
- A multiobjective -constraint based approach for the robust master surgical schedule under multiple uncertainties
- 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
- Multi-objective location-allocation optimization of temporary delivery points for medical supplies during large-scale epidemic outbreaks
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Decision support models in climate policy
- A multi-criteria decision framework for sustainable supplier selection and order allocation using multi-objective optimization and fuzzy approach
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A hybrid approach based on multi-criteria decision making and data-driven optimization in solving portfolio selection problem
- Advanced network connectivity features and zonal requirements in covering location problems
- An integrated model of supply chain resilience considering supply and demand uncertainties
- 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
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- 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
- An exact algorithm for biobjective mixed integer linear programming problems
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- A review of multi-objective optimization methods for personnel rostering problems
- A multi-objective mixed integer linear programming model for thesis defence scheduling
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- Solution approaches for equitable multiobjective integer programming problems
- Column generation based solution for bi-objective gate assignment problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A hybrid approach for biobjective optimization
- Bi-objective stochastic supply chain network design under supplier and facility disruption risks
- 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
- Hierarchical p-hub center problem for perishable goods
- An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain
- Bi-objective model for the distribution of COVID-19 vaccines
- 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
- A circular food supply chain network model to reduce food waste
- Investigating a citrus fruit supply chain network considering \(\mathrm{CO}_2\) emissions using meta-heuristic algorithms
- Logic-based Benders decomposition for doctor-patient matching and scheduling considering chronic patients' online consultation time preference
- Reconsidering compact measures: a multiobjective framework for ecological reserve design
- 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
- Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms
- Balancing the trade-off between efficiency and equity in a stochastic emergency supplies allocation problem
- Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model
- A multi-product model for evaluating and selecting two layers of suppliers considering environmental factors
- Methods for bi-objective routing and districting problems
- The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility
- A resilient model for humanitarian relief logistics: integrating relief time, health services, and hygiene items for sustainable development goals
- 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
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)
