Sciweavers

3433 search results - page 22 / 687
» Heuristics for a bidding problem
Sort
View
CPAIOR
2005
Springer
14 years 1 months ago
The Temporal Knapsack Problem and Its Solution
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian...
SIGECOM
2006
ACM
93views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
The sequential auction problem on eBay: an empirical analysis and a solution
Bidders on eBay have no dominant bidding strategy when faced with multiple auctions each offering an item of interest. As seen through an analysis of 1,956 auctions on eBay for a...
Adam I. Juda, David C. Parkes
LION
2010
Springer
307views Optimization» more  LION 2010»
14 years 12 days ago
A Column Generation Heuristic for the General Vehicle Routing Problem
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...
Asvin Goel
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
COR
2002
58views more  COR 2002»
13 years 7 months ago
Fast heuristics for large scale covering-location problems
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
Luce Brotcorne, Gilbert Laporte, Fréd&eacut...