Pages that link to "Item:Q2572861"
From MaRDI portal
The following pages link to An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method (Q2572861):
Displayed 20 items.
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection (Q531474) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Equity portfolio construction and selection using multiobjective mathematical programming (Q975768) (← links)
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems (Q1029383) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
- Outer Branching: How to Optimize under Partial Orders? (Q3649598) (← links)
- On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)