Sciweavers

400 search results - page 30 / 80
» Extended formulations in combinatorial optimization
Sort
View
IOR
2011
175views more  IOR 2011»
14 years 6 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
91
Voted
GLOBECOM
2008
IEEE
14 years 12 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...
GLOBECOM
2008
IEEE
15 years 6 months ago
Global Optimal Routing, Scheduling and Power Control for Multi-Hop Wireless Networks with Interference
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
94
Voted
NIPS
2007
15 years 1 months ago
DIFFRAC: a discriminative and flexible framework for clustering
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
Francis Bach, Zaïd Harchaoui
CCE
2005
14 years 11 months ago
Wastewater minimisation using central reusable water storage in batch plants
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
Thokozani Majozi