Sciweavers

3433 search results - page 158 / 687
» Heuristics for a bidding problem
Sort
View
AAAI
1990
15 years 7 months ago
A Design Based Approach to Constructing Computational Solutions to Diagnostic Problems
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
D. Volovik, Imran A. Zualkernan, Paul E. Johnson, ...
EOR
2008
91views more  EOR 2008»
15 years 6 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
COR
2004
146views more  COR 2004»
15 years 6 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
ESA
2009
Springer
151views Algorithms» more  ESA 2009»
16 years 1 months ago
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signiï¬...
Rudolf Fleischer, Xi Wu, Liwei Yuan
HM
2007
Springer
135views Optimization» more  HM 2007»
16 years 21 days ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik