Sciweavers

1263 search results - page 25 / 253
» A* with Bounded Costs
Sort
View
88
Voted
EOR
2002
99views more  EOR 2002»
14 years 9 months ago
Network cost minimization using threshold-based discounting
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin...
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
14 years 11 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
CPAIOR
2007
Springer
15 years 3 months ago
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
71
Voted
ENDM
2010
67views more  ENDM 2010»
14 years 7 months ago
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
Christian Artigues, Nicolas Jozefowiez, Mohamed Al...
IJCV
2012
13 years 2 days ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...