145
Voted
COCOA
15 years 2 months ago
2008 Springer 
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...
118
click to vote
COCOA
15 years 1 months ago
2008 Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
108
click to vote
COCOA
15 years 2 months ago
2008 Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
107
click to vote
COCOA
15 years 2 months ago
2008 Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
94
Voted
COCOA
15 years 2 months ago
2008 Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
|
Discrete Geometry