Sciweavers

400 search results - page 25 / 80
» Extended formulations in combinatorial optimization
Sort
View
SCALESPACE
2009
Springer
15 years 6 months ago
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
Jan Lellmann, Jörg H. Kappes, Jing Yuan, Flor...
EVOW
2007
Springer
15 years 6 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
GLOBECOM
2006
IEEE
15 years 5 months ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...
113
Voted
EOR
2011
140views more  EOR 2011»
14 years 3 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
ISCC
2002
IEEE
15 years 4 months ago
Resource and performance management in wireless communication networks
In this paper, we study the problems of resource and performance management in channelized wireless networks. For identifying research issues systematically, we propose a research...
Chih-Hao Lin, Frank Yeong-Sung Lin