Pages that link to "Item:Q1141079"

The following pages link to Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis (Q1141079):

Displaying 18 items.

• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
• Statistical mechanics of a simplified bipartite matching problem: An analytical treatment (Q2428513) (← links)
• A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
• Linear and semi-assignment problems: A core oriented approach (Q2563894) (← links)
• Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
• An efficient heuristic algorithm for minimum matching (Q3202140) (← links)
• A new linearization method for quadratic assignment problems (Q3423596) (← links)
• Solving matching problems with linear programming (Q3703653) (← links)
• Euclidean matching problems and the metropolis algorithm (Q3727741) (← links)
• An in-core/out-of-core method for solving large scale assignment problems (Q3763916) (← links)
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
• A heuristic for decomposing traffic matrices in TDMA satellite communication (Q4277996) (← links)
• How much reliable are the integrated ‘live’ data? A validation strategy proposal for the non-parametric micro statistical matching (Q5861501) (← links)
• Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems (Q5937358) (← links)
• A branch and bound method for solving the bidirectional circular layout problem (Q5961820) (← links)
• Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
• Linear Programming on the Stiefel Manifold (Q6202765) (← links)