414 search results - page 33 / 83 » Integer Linear Programming Models for Global Routing |
64
Voted
COR
2010
14 years 9 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
MJ
2007
14 years 9 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
EMNLP
2011
13 years 9 months ago
2011
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
91
Voted
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
ATMOS
2008
14 years 11 months ago
2008
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...