The following pages link to (Q4889471):
Displaying 50 items.
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives (Q319921) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- A new complexity result on multiobjective linear integer programming using short rational generating functions (Q691389) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis) (Q862824) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- A biobjective optimization model for deadline satisfaction in line-of-balance scheduling with work interruptions consideration (Q1721280) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- A bi-criteria approach for the data association problem (Q2379873) (← links)
- Multi-criteria assignment problem with incompatibility and capacity constraints (Q2379877) (← links)
- Multiobjective blockmodeling for social network analysis (Q2442107) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- Primal-dual simplex method for multiobjective linear programming (Q2471113) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)