Local Cuts Revisited

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) Local Cuts Revisited.
Published in: Operations Research Letters Vol. 36 (4). pp. 430-433.

Abstract

We present a variant of the local cut generation procedure by Applegate, Bixby, Chvatal and Cook. Unlike the original procedure, our method immediately yields a facet of the projected polytope as the solution of a single LP, without the need of the time-consuming tilting step. Moreover, our facets have big volume in general.


Actions:
Full text not available from this repository. (Request a copy)
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: 11 (Google Scholar) | 1 (Web of Science)
Uncontrolled Keywords: branch-and-cut local cuts traveling salesman problem
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C90 Applications of mathematical programming

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Institute of Computer Science > Projects > COPhy (Combinatorial Optimization in Physics)
    Related URLs:
    Deposit Information:
    ZAIK Number: zaik2007-535
    Depositing User: Christoph Buchheim
    Date Deposited: 29 Jan 2009 00:00
    Last Modified: 06 Feb 2012 16:17
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/535