COCOA 2008 - PDF Preprint Papers

COCOA 2008 International Conference on Combinatorial Optimization and Applications

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOA-2008 Paper

click to vote

COCOA
2008
Springer

343views Discrete Geometry» more COCOA 2008»

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

13 years 6 months ago

Download www.informatik.uni-kiel.de

We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...

Gerold Jäger, Paul Molitor

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	343	Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order	claim
2	174	Automatic Generation of Symmetry-Breaking Constraints	claim
3	167	Strong Formulations for 2-Node-Connected Steiner Network Problems	claim
4	165	Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph	claim
5	156	New Algorithms for k-Center and Extensions	claim
6	155	Magic Labelings on Cycles and Wheels	claim
7	152	Computational Study on Dominating Set Problem of Planar Graphs	claim
8	149	On Recovering Syntenic Blocks from Comparative Maps	claim
9	142	Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region	claim
10	140	Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems	claim
11	133	Stochastic Online Scheduling Revisited	claim
12	129	Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems	claim
13	124	Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization	claim
14	117	Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem	claim
15	115	Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries	claim
16	112	Enumerating Isolated Cliques in Synthetic and Financial Networks	claim
17	105	Simplicial Powers of Graphs	claim
18	105	Parameterized Graph Editing with Chosen Vertex Degrees	claim
19	104	Going Weighted: Parameterized Algorithms for Cluster Editing	claim
20	103	Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets	claim
21	100	Protean Graphs with a Variety of Ranking Schemes	claim
22	88	A Parameterized Perspective on Packing Paths of Length Two	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers