Sciweavers

222 search results - page 2 / 45
» A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Sort
View
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 8 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
ATMOS
2007
183views Optimization» more  ATMOS 2007»
13 years 6 months ago
Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...
CP
2005
Springer
13 years 10 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
PPAM
2007
Springer
13 years 11 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 2 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor