Sciweavers

2976 search results - page 239 / 596
» On the bounded integer programming
Sort
View
164
Voted
MP
2010
132views more  MP 2010»
15 years 28 days ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 6 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
POPL
2010
ACM
16 years 3 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
JGO
2011
149views more  JGO 2011»
15 years 1 months ago
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
Ronaldo Gregório, Paulo Roberto Oliveira