Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis

Publication date: 1980

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

algorithms combinatorial optimization quadratic assignment problem cutting planes heuristic algorithm linear assignment problem computer codes branch-and-bound procedure linear bottleneck assignment problem cardinality matching problem exchange techniques sum matching problem undirected Chinese postman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

On the existence of weak greedy matching heuristics, An efficient matching algorithm applied in statistical physics, Solving matching problems with linear programming, Strengthening Gilmore's bound for the quadratic assignment problem, An algorithm for the planar three-index assignment problem, Minimizing variation of production rates in just-in-time systems: A survey, A shortest augmenting path algorithm for dense and sparse linear assignment problems, A new exact algorithm for the solution of quadratic assignment problems, A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems, Primal-dual algorithms for the assignment problem, A capacitated general routing problem on mixed networks, A heuristic for decomposing traffic matrices in TDMA satellite communication, Special cases of travelling salesman problems and heuristics, Euclidean matching problems and the metropolis algorithm, A survey for the quadratic assignment problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A heuristic method for the multi-story layout problem, Solution of placement and routing problems in telephone exchange unit designs, Scaling and structural condition numbers, Quadratic assignment problems, A concept for parameter independent evaluation of decentralized stabilizability, An efficient heuristic algorithm for minimum matching, A new pivoting strategy for Gaussian elimination, Solution methods and computational investigations for the linear bottleneck assignment problem, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, The bottleneck generalized assignment problem, An in-core/out-of-core method for solving large scale assignment problems, Integrating combinatorial algorithms into a linear programming solver, Gilmore-Lawler bound of quadratic assignment problem, Statistical mechanics of a simplified bipartite matching problem: An analytical treatment, Linear Programming on the Stiefel Manifold, Transportation problems which can be solved by the use of hirsch-paths for the dual problems, Algorithms and codes for dense assignment problems: The state of the art, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs, Layout design for flexible manufacturing systems, A cutting plane algorithm for the windy postman problem, Algorithms for robust single and multiple period layout planning for manufacturing systems, Modeling uncertainties in plant layout problems, Discrete optimization: an Austrian view, Selected topics on assignment problems, Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems, Path integral calculations of vacancies in solid helium, A new heuristic for the fleet size and mix vehicle routing problem, A hybrid heuristic for the facilities layout problem, A hybrid metaheuristic for the quadratic assignment problem, A branch and bound method for solving the bidirectional circular layout problem, Resource constrained assignment problems, A genetic-based framework for solving (multi-criteria) weighted matching problems., Solving (large scale) matching problems combinatorially, To lay out or not to lay out?, Network-based formulations of the quadratic assignment problem, Linear and semi-assignment problems: A core oriented approach, Algorithm for the solution of the assignment problem for sparse matrices, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, Recent trends in combinatorial optimization, A new linearization method for quadratic assignment problems, Network models for vehicle and crew scheduling, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Alternate strategies for solving bottleneck assignment problems - analysis and computational results, How much reliable are the integrated ‘live’ data? A validation strategy proposal for the non-parametric micro statistical matching, The fleet size and mix problem for capacitated arc routing, Development and evaluation of an assignment heuristic for allocating cross-trained workers, An exact algorithm for the general quadratic assignment problem, On the use of optimal fractional matchings for solving the (integer) matching problem, An efficient algorithm for the bipartite matching problem, An efficient labeling technique for solving sparse assignment problems, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods