Sciweavers

14649 search results - page 427 / 2930
» Principles of problem solving
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
HPCN
1995
Springer
15 years 10 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
AIPS
2007
15 years 9 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
152
Voted
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
15 years 8 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
EVOW
2008
Springer
15 years 8 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...