Sciweavers

1723 search results - page 147 / 345
» Cycling in linear programming problems
Sort
View
CORR
2002
Springer
133views Education» more  CORR 2002»
14 years 9 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
WLP
2005
Springer
15 years 3 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
CDC
2008
IEEE
159views Control Systems» more  CDC 2008»
15 years 4 months ago
Incorporating drivability metrics into optimal energy management strategies for Hybrid Vehicles
— Hybrid Vehicle fuel economy performance is highly sensitive to the energy management strategy used to select among multiple energy sources. Optimal solutions are easy to specif...
Daniel F. Opila, Deepak Aswani, Ryan McGee, Jeffre...
JSW
2007
173views more  JSW 2007»
14 years 10 months ago
Towards Semantics Driven Generation of Executable Web Services Compositions
— Web services composition is a very active area of research due to the growing interest of public and private organizations in services integration and/or low cost development o...
Giusy Di Lorenzo, Nicola Mazzocca, Francesco Mosca...