Sciweavers

19130 search results - page 171 / 3826
» Modelling multi-path problems
Sort
View
ICCABS
2011
14 years 10 months ago
High-performance biocomputing for simulating the spread of contagion over large contact networks
Abstract—Many important biological problems can be modeled as contagion diffusion processes over interaction networks. This paper shows how the EpiSimdemics interaction-based sim...
Keith R. Bisset, Ashwin M. Aji, Madhav V. Marathe,...
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 12 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
CCE
2004
15 years 6 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
CPAIOR
2009
Springer
16 years 1 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan