Harvey H. Millar  Home/Search
Context
Related
| iasted.com/conferences/20...308016.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iasted.com/confer...pittsburgh125 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present a zero-one integer formulation for the TSP with 2n 2 variables and n 3 - 4n 2 +11n-6 constraints. The formulation exploits two embedded assignment problems in the TSP polytope. One problem deals with linking cities to cities, while the other assigns the cities to the N positions on the TSP tour. The two assignment problems are coupled through logical constraints. We present a Lagrangean algorithm to solve the TSP solutions and provide valid lower bounds. Some... (Update)
Similar documents based on text: More All
0.2: A Computational Study of Three Formulations for Batch Sizing in.. - Millar (2000) (Correct)
0.1: A Case-Based Reasoning System Involving A Quantized.. - Kuchar, Lazukova.. (Correct)
0.1: Lagrangean/Surrogate Heuristics for p-Median Problems - Senne, Lorena (2000) (Correct)
BibTeX entry: (Update)
@misc{ millar-alternate,
author = "Harvey H. Millar",
title = "An Alternate Formulation and Lagrangean Heuristic for the Traveling Salesperson
Problem",
url = "citeseer.ist.psu.edu/millar99alternate.html" }
Citations (may not include all citations):141 An effective heuristic algorithm for the traveling salesman .. (context) - Lin, Kernighan - 1973
106 The traveling salesman problem. A Guided tour of combinatori.. (context) - Lawler, Lenstra et al. - 1985
24 A patching algorithm for the nonsymmetric traveling salesman.. (context) - Karp - 1979
15 Boltzmann machines for traveling salesman problems (context) - Aarts, Korst - 1989
9 Lagrangean decomposition: a model yielding stronger Lagrange.. (context) - Guignard, Kim - 1987
7 The traveling salesman problem: An overview of exact and app.. (context) - Laporte - 1992
5 Integer programming formulations and traveling salesman prob.. (context) - Miller, Tucker et al. - 1960
2 Layering strategies for creating exploitable structure in li.. (context) - Glover, Klingman - 1988
2 An analytical comparison of different formulations of the tr.. (context) - Padberg, Sung - 1991
1 Classification of traveling salesman problem formulations (context) - Langevin, Soumis et al. - 1990
1 A new formulation for the traveling salesman problem (context) - Claus - 1984
1 Solution of a large traveling salesman problem (context) - Dantzig, Fulkerson et al. - 1954
1 Lagrangean dual ascent algorithms for computing bounds in ca.. (context) - Guignard, Opaswongkarn - 1987
1 A two-commodity network flow approach to the traveling sales.. (context) - Finke, Claus et al. - 1984
1 and S. Graves, "An n-constraint formulation of the (time-dep.. (context) - Fox, Gavish - 1980
[Article contains additional citations not shown here]
Documents on the same site (http://www.iasted.com/conferences/2000/pittsburgh/pittsburgh125.htm): More
Development Of Software Tool For Generating Coverability Tree.. - Hoque, Tarek (2000) (Correct)
Secondary Path On-line Modeling in Active Noise Control Using.. - Riyanto (2000) (Correct)
Deming's Legacy IV: Quality Culture - Selman, Selman, Selman, Cory (2000) (Correct)
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