M. Dell'Amico and S. Martello. Linear assignment. In F. Ma#oli M. Dell'Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355--371. Wiley, 1997. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Reduced Cost-Based Ranking for Generating Promising Subproblems - Milano, van Hoeve (2002) (Correct)
....TSPTW, we add to the TSP model a domain variable Start i which identifies the time at which the service begins at node i. A well known relaxation of the TSP and TSPTW obtained by eliminating from the TSP model constraints (4) and time windows constraints is the Linear Assignment Problem (AP) see [3] for a survey) AP is the graph theory problem 5 of finding a set of disjoint subtours such that all the vertices in V are visited and the overall cost is a minimum. When the digraph is complete, as in our case, AP always has an optimal integer solution, and, if such solution is composed by a ....
M. Dell'Amico and S. Martello. Linear assignment. In F. Ma#oli M. Dell'Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355--371. Wiley, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC