Pages that link to "Item:Q1841810"

The following pages link to A survey and annotated bibliography of multiobjective combinatorial optimization (Q1841810):

Displaying 50 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives (Q319921) (← links)
• Multicriteria optimization in humanitarian aid (Q322891) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
• A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling (Q421082) (← links)
• Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
• Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
• Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives (Q519662) (← links)
• FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
• A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
• Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
• The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
• On linear vector program and vector matrix game equivalence (Q691454) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning (Q726254) (← links)
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
• Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection (Q819077) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• A biobjective optimization model for routing in mobile ad hoc networks (Q840189) (← links)
• Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
• A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
• Decision-support with preference constraints (Q857275) (← links)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia (Q857313) (← links)
• Multi-objectives tabu search based algorithm for progressive resource allocation (Q857318) (← links)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
• A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
• Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
• Preference programming for robust portfolio modeling and project selection (Q877643) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
• Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
• An exact method for a discrete multiobjective linear fractional optimization (Q952706) (← links)
• A methodology for assessing eco-efficiency in logistics networks (Q954900) (← links)
• Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
• Branch and bound method for multiobjective pairing selection (Q980932) (← links)
• Multiple criteria facility location problems: a survey (Q988401) (← links)