Sciweavers

867 search results - page 93 / 174
» An Evolutionary Algorithm for Integer Programming
Sort
View
DAC
2006
ACM
16 years 7 months ago
Optimal cell flipping in placement and floorplanning
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
Chiu-Wing Sham, Evangeline F. Y. Young, Chris C. N...
INFORMS
2010
125views more  INFORMS 2010»
15 years 5 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
AINA
2008
IEEE
16 years 1 months ago
A New Service Level Agreement Model for Best-Effort Traffics in IP over WDM
In this paper, we propose a new SLA model for best effort IP traffic over WDM networks. This model jointly considers two QoS metrics, workable traffic volume and availability, as ...
Hung-Yi Chang, Pi-Chung Wang, Chia-Tai Chan, Chun-...
MFCS
2005
Springer
16 years 2 days ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
AMAI
2004
Springer
15 years 12 months ago
Heuristics for a Brokering Set Packing Problem
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu