Sciweavers

16596 search results - page 175 / 3320
» Generalized Assignment Problems
Sort
View
AIR
2004
111views more  AIR 2004»
15 years 2 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
NETWORKS
2010
15 years 26 days ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
MP
2010
163views more  MP 2010»
14 years 9 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
CP
1999
Springer
15 years 6 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
123
Voted
AIPS
2011
14 years 6 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...