Pages that link to "Item:Q1339178"

The following pages link to On spanning tree problems with multiple objectives (Q1339178):

Displaying 50 items.

• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
• Generalized multiple objective bottleneck problems (Q453049) (← links)
• An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
• Optimization problems in multiple subtree graphs (Q531599) (← links)
• A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
• Decision making with multiple objectives using GAI networks (Q646528) (← links)
• Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← 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)
• Minimum spanning trees made easier via multi-objective optimization (Q862963) (← links)
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (Q884444) (← links)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
• Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Connectedness of efficient solutions in multiple criteria combinatorial optimization (Q1278594) (← links)
• Geometric methods to solve max-ordering location problems (Q1289016) (← links)
• The hybrid spanning tree problem (Q1333484) (← links)
• On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
• Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
• Combining linear and nonlinear objectives in spanning tree problems (Q1583705) (← links)
• A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem (Q1761771) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
• The problem of the optimal biobjective spanning tree (Q1806877) (← links)
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm (Q1848402) (← links)
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
• On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• Dynamic programming for spanning tree problems: application to the multi-objective case (Q2018859) (← links)
• Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
• A multi-agent transgenetic algorithm for the bi-objective spanning tree problem (Q2132380) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Combining local search and elicitation for multi-objective combinatorial optimization (Q2290362) (← links)
• Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• Computing all efficient solutions of the biobjective minimum spanning tree problem (Q2384598) (← links)
• On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
• The complexity of minimum ratio spanning tree problems (Q2574099) (← links)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
• On matroids with multiple objectives (Q2785392) (← links)
• An exact method to generate all nondominated spanning trees (Q2954355) (← links)
• An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information (Q3297811) (← links)
• Maximal Direct Covering Tree Problems (Q3474491) (← links)