Sciweavers

3433 search results - page 32 / 687
» Heuristics for a bidding problem
Sort
View
ICTAI
2005
IEEE
14 years 1 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
IPPS
1999
IEEE
13 years 12 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
EOR
2008
107views more  EOR 2008»
13 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
AIR
2004
134views more  AIR 2004»
13 years 7 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma
EOR
2010
107views more  EOR 2010»
13 years 7 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...