Sciweavers

149 search results - page 2 / 30
» Solving large scale combinatorial optimization using PMA-SLS
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 6 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
ATMOS
2007
183views Optimization» more  ATMOS 2007»
13 years 6 months ago
Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...
AAAI
2000
13 years 6 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
CP
2005
Springer
13 years 10 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
IJCSA
2007
130views more  IJCSA 2007»
13 years 4 months ago
Binary Particle Swarm Optimization Based Defensive Islanding Of Large Scale Power Systems
Power system defensive islanding is an efficient way to avoid catastrophic wide area blackouts, such as the 2003 North American Blackout. Finding defensive islands of large-scale ...
Wenxin Liu, Li Liu, David A. Cartes, Ganesh K. Ven...