### Skapa referens, olika format (klipp och klistra)

**Harvard**

Gollowitzer, S., Pereira, D. och Wojciechowski, A. (2011) *New Models for and Numerical Tests of the Hamiltonian p-Median Problem*.

** BibTeX **

@conference{

Gollowitzer2011,

author={Gollowitzer, Stefan and Pereira, Dilson Lucas and Wojciechowski, Adam},

title={New Models for and Numerical Tests of the Hamiltonian p-Median Problem},

booktitle={Lecture Notes in Computer Science},

isbn={978-364221526-1},

pages={385-394},

abstract={The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two well-known problems, namely the Travelling Salesman problem (TSP) and the Vehicle Routing problem (VRP). The HpMP is to find exactly p node-disjoint cycles of minimum edge cost, such that each node of the graph is contained in exactly one cycle. We present three new models for the HpMP problem which differ with regard to the constraints that enforce a maximum number of cycles. We demonstrate that one of the models (SEC) is dominated by another model (PCON) with regard to the LP relaxation. Further, we introduce a class of symmetry breaking constraints. We present results regarding the quality of the lower bounds provided by the respective LP relaxations for two of the models, and provide computational results that demonstrate the computational efficiency.},

year={2011},

keywords={Hamiltonian p-Median, },

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 153575

A1 Gollowitzer, Stefan

A1 Pereira, Dilson Lucas

A1 Wojciechowski, Adam

T1 New Models for and Numerical Tests of the Hamiltonian p-Median Problem

YR 2011

T2 Lecture Notes in Computer Science

SN 978-364221526-1

SP 385

OP 394

AB The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two well-known problems, namely the Travelling Salesman problem (TSP) and the Vehicle Routing problem (VRP). The HpMP is to find exactly p node-disjoint cycles of minimum edge cost, such that each node of the graph is contained in exactly one cycle. We present three new models for the HpMP problem which differ with regard to the constraints that enforce a maximum number of cycles. We demonstrate that one of the models (SEC) is dominated by another model (PCON) with regard to the LP relaxation. Further, we introduce a class of symmetry breaking constraints. We present results regarding the quality of the lower bounds provided by the respective LP relaxations for two of the models, and provide computational results that demonstrate the computational efficiency.

LA eng

DO 10.1007/978-3-642-21527-8_43

LK http://dx.doi.org/10.1007/978-3-642-21527-8_43

OL 30