Sciweavers

400 search results - page 5 / 80
» Extended formulations in combinatorial optimization
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ATMOS
2010
308views Optimization» more  ATMOS 2010»
14 years 8 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...

Publication
325views
16 years 7 months ago
An Optimal Multi-Unit Combinatorial Procurement Auction with Single Minded Bidders
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...
Sujit Guajr, Y Narahari
CEC
2008
IEEE
15 years 4 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
TASE
2010
IEEE
14 years 4 months ago
Optimization of Group Elevator Scheduling With Advance Information
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
Jin Sun, Qianchuan Zhao, Peter B. Luh