Sciweavers

1723 search results - page 134 / 345
» Cycling in linear programming problems
Sort
View
COLING
2010
14 years 5 months ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
POPL
2010
ACM
15 years 7 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
CPAIOR
2005
Springer
15 years 3 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
OL
2010
77views more  OL 2010»
14 years 8 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre
CP
2003
Springer
15 years 3 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann