A simple augmented -constraint method for multi-objective mathematical integer programming problems
From MaRDI portal
Publication:2256164
Recommendations
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Improved -constraint method for multiobjective programming
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- A COMPUTATIONAL APPROACH BASED ON THE \epsilon-CONSTRAINT METHOD IN MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
- Multiobjective optimization with \(\epsilon\)-constrained method for solving real-parameter constrained optimization problems
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method
- Epsilon approximate solutions for multiobjective programming problems
- Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
- An augmented Lagrange function method for multicriterion optimization problems
Cites work
- scientific article; zbMATH DE number 5917374 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1149798 (Why is no real title available?)
- scientific article; zbMATH DE number 3999655 (Why is no real title available?)
- A discussion of scalarization techniques for multiple objective integer programming
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- 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 reduction algorithm for integer multiple objective linear programs
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A survey of recent developments in multiobjective optimization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An algorithm for the multiple objective integer linear programming problem
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Handbook of multicriteria analysis
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective optimization using evolutionary algorithms
- Multicriteria Optimization
- Multicriteria analysis: Survey and new directions
- Multiobjective optimization. Interactive and evolutionary approaches
- Multiobjective optimization: a brief overview
- Multiobjective programming and planning
- Multiple criteria decision analysis. State of the art surveys
- Multiple criteria decision support -- a review
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multiple objective programming and goal programming: new trends and applications
- Nonlinear multiobjective optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Soft computing for complex multiple criteria decision making
- Theory of multiobjective optimization
Cited in
(19)- Optimizing a linear function over the nondominated set of multiobjective integer programs
- Investigating of transportation systems development for urban districts, costs and social equity: a case of Sanandaj, Kurdistan
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- Solution approaches for equitable multiobjective integer programming problems
- A decision-making tool for energy efficiency optimization of street lighting
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A multi-objective approach for intermodal train load planning
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
- The multimodal and multiperiod urban transportation integrated timetable construction problem with demand uncertainty
- Integrated business continuity and disaster recovery planning: towards organizational resilience
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem
- An exact algorithm for biobjective mixed integer linear programming problems
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Robust optimization for the cyclic hoist scheduling problem
This page was built for publication: A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256164)
