Author: Jsun Y. Wong
Publisher:
ISBN:
Category :
Languages : en
Pages : 216
Book Description
Solving Quadratic Assignment Problems with Rectangular Distances and Integer Programming
Author: Jsun Y. Wong
Publisher:
ISBN:
Category :
Languages : en
Pages : 216
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 216
Book Description
Integer Programming and Related Areas A Classified Bibliography 1976–1978
Author: D. Hausmann
Publisher: Springer Science & Business Media
ISBN: 3642463835
Category : Business & Economics
Languages : en
Pages : 326
Book Description
Publisher: Springer Science & Business Media
ISBN: 3642463835
Category : Business & Economics
Languages : en
Pages : 326
Book Description
Quadratic Assignment and Related Problems
Author: Panos M. Pardalos
Publisher: American Mathematical Soc.
ISBN: 9780821870624
Category : Mathematics
Languages : en
Pages : 380
Book Description
The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.
Publisher: American Mathematical Soc.
ISBN: 9780821870624
Category : Mathematics
Languages : en
Pages : 380
Book Description
The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.
Naval Research Logistics Quarterly
Author:
Publisher:
ISBN:
Category : Logistics, Naval
Languages : en
Pages : 1180
Book Description
Publisher:
ISBN:
Category : Logistics, Naval
Languages : en
Pages : 1180
Book Description
Logistics of Facility Location and Allocation
Author: Dileep R. Sule
Publisher: CRC Press
ISBN: 9780203910405
Category : Business & Economics
Languages : en
Pages : 480
Book Description
An introduction to pragmatic methods for solving complex problems in facilities location: choosing from among known feasible sites or a broad range described as an area, placing facilities, and assigning customers. It emphasizes careful location and customer allocation to determine optimum use of time and cost - improving flow of materials and serv
Publisher: CRC Press
ISBN: 9780203910405
Category : Business & Economics
Languages : en
Pages : 480
Book Description
An introduction to pragmatic methods for solving complex problems in facilities location: choosing from among known feasible sites or a broad range described as an area, placing facilities, and assigning customers. It emphasizes careful location and customer allocation to determine optimum use of time and cost - improving flow of materials and serv
Location and Layout Planning
Author: W. Domschke
Publisher: Springer Science & Business Media
ISBN: 3662024470
Category : Business & Economics
Languages : en
Pages : 142
Book Description
Publisher: Springer Science & Business Media
ISBN: 3662024470
Category : Business & Economics
Languages : en
Pages : 142
Book Description
NAVAL RESEARCH LOGISTICS QUARTERLY
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Door Assignment and Sequencing Problems in Crossdocks and Container Terminals
Author: Hector J. Carlo
Publisher:
ISBN:
Category :
Languages : en
Pages : 602
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 602
Book Description
The Quadratic Assignment Problem
Author: E. Cela
Publisher: Springer Science & Business Media
ISBN: 1475727879
Category : Mathematics
Languages : en
Pages : 296
Book Description
The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Publisher: Springer Science & Business Media
ISBN: 1475727879
Category : Mathematics
Languages : en
Pages : 296
Book Description
The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Annual Department of Defense Bibliography of Logistics Studies and Related Documents
Author: United States. Defense Logistics Studies Information Exchange
Publisher:
ISBN:
Category : Military research
Languages : en
Pages : 1140
Book Description
Publisher:
ISBN:
Category : Military research
Languages : en
Pages : 1140
Book Description