Pages that link to "Item:Q3981514"

The following pages link to An Algorithm for the Three-Index Assignment Problem (Q3981514):

Displaying 46 items.

• Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
• Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
• Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
• Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
• Facets of the axial three-index assignment polytope (Q908296) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Random assignment problems (Q953417) (← links)
• New lower bounds for the triplanar assignment problem. Use of the classical model (Q1003082) (← links)
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
• Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
• Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
• Geometric three-dimensional assignment problems (Q1278259) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
• An algorithm for the planar three-index assignment problem (Q1333481) (← links)
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← links)
• Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
• Extending single tolerances to set tolerances (Q1671336) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
• A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
• Linear-time separation algorithms for the three-index assignment polytope (Q1801663) (← links)
• Scheduling sports competitions on multiple venues. (Q1810517) (← links)
• Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
• Global tolerances in the problems of combinatorial optimization with an additive objective function (Q1930843) (← links)
• Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
• Combining solutions of the axial assignment problem (Q2052595) (← links)
• Heuristic strategies for combining solutions of the three-index axial assignment problem (Q2069670) (← links)
• On a property of a three-dimensional matrix (Q2249936) (← links)
• A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• A heuristic method for solving integer-valued decompositional multiindex problems (Q2261778) (← links)
• On representatives of multi-index transportation problems (Q2367389) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← links)
• The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• On multi-index assignment polytopes (Q2494661) (← links)
• A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
• Branch and bound algorithms for the multidimensional assignment problem (Q5312759) (← links)