Sciweavers

342 search results - page 36 / 69
» Constrained Integer Partitions
Sort
View
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
15 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
ANOR
2008
93views more  ANOR 2008»
14 years 10 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
14 years 10 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
EACL
2009
ACL Anthology
14 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
14 years 9 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari