3433 search results - page 33 / 687 » Heuristics for a bidding problem |
177
click to vote
EUROCAST
2009
Springer
16 years 22 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
153
click to vote
AIMSA
2008
Springer
16 years 16 days ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
140
click to vote
CONSTRAINTS
2000
15 years 6 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
148
click to vote
COR
2010
15 years 6 months ago
2010
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
177
click to vote
ATMOS
2010
15 years 5 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...