Sciweavers

1723 search results - page 91 / 345
» Cycling in linear programming problems
Sort
View
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 9 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
DAM
2008
92views more  DAM 2008»
15 years 3 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
IPL
2008
109views more  IPL 2008»
15 years 3 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
ICALP
2005
Springer
15 years 8 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
EOR
2007
89views more  EOR 2007»
15 years 3 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...