Pages that link to "Item:Q1141079"
From MaRDI portal
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 50 items.
- Discrete optimization: an Austrian view (Q537581) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Path integral calculations of vacancies in solid helium (Q711182) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- To lay out or not to lay out? (Q763111) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- A thermodynamically motivated simulation procedure for combinatorial optimization problems (Q794925) (← links)
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The fleet size and mix problem for capacitated arc routing (Q1064973) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- On the use of optimal fractional matchings for solving the (integer) matching problem (Q1068525) (← links)
- An efficient algorithm for the bipartite matching problem (Q1069866) (← links)
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- Solution of placement and routing problems in telephone exchange unit designs (Q1109671) (← links)
- A concept for parameter independent evaluation of decentralized stabilizability (Q1117189) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Layout design for flexible manufacturing systems (Q1197691) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Algorithms for robust single and multiple period layout planning for manufacturing systems (Q1205706) (← links)
- Modeling uncertainties in plant layout problems (Q1205712) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
- An algorithm for the planar three-index assignment problem (Q1333481) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Scaling and structural condition numbers (Q1368765) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- Development and evaluation of an assignment heuristic for allocating cross-trained workers (Q1600882) (← links)
- A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
- Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems (Q1838910) (← links)
- A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems'' (Q1890955) (← links)
- A capacitated general routing problem on mixed networks (Q1894722) (← links)
- A new pivoting strategy for Gaussian elimination (Q1915612) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
- Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
