Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract
-
Cited by 401 (2 self)
- Add to MetaCart
paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube
"... In this paper, we present a new algorithm to solve the integral knapsack problem on the hypercube. The main idea is to use the fact that the precedence graph of the dynamic programming function of the knapsack problem is an irregular mesh. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this paper, we present a new algorithm to solve the integral knapsack problem on the hypercube. The main idea is to use the fact that the precedence graph of the dynamic programming function of the knapsack problem is an irregular mesh.
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
"... ... where all entries of c, U,and d are nonnegative. Given such a formulation, the ratio betweenthe optimal integer solution and the optimal solution to the linear program relaxation can be as bad as jjdjj1, even when U consistsof a single row. We show that by adding additional inequalities, this ra ..."
Abstract
-
Cited by 85 (1 self)
- Add to MetaCart
capacities equal1. For capacitated network design problems, we show that this improved ratio depends on a parameter of the graph, and we alsoprovide polynomial-time approximation algorithms to match this bound. This improves on the best previous m-approximation,where m is the number of edges in the graph. We
A new effective dynamic program for . . .
, 2015
"... After a series of publications of T.E. O’Neil et al. (e.g. in 2010), dynamic programming seems to be the most promising way to solve knapsack problems. Some techniques are known to make dynamic programming algorithms (DPA) faster. One of them is the graphical method that deals with piecewise linear ..."
Abstract
- Add to MetaCart
After a series of publications of T.E. O’Neil et al. (e.g. in 2010), dynamic programming seems to be the most promising way to solve knapsack problems. Some techniques are known to make dynamic programming algorithms (DPA) faster. One of them is the graphical method that deals with piecewise linear
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
"... The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve it with the aid of network flow algorithms. In this paper, we discuss this problem under a mobile environment with limited c ..."
Abstract
- Add to MetaCart
this optimization problem to the 0/1 Knapsack Problem, and therefore show that it is NP-hard. Second, two heuristic algorithms are proposed. One is an adaptive heuristic algorithm with complexity O(NE), here, N and E represent the number of nodes and edges in the object graph abstracted from the mobile application
Pareto-optimization-based runtime task scheduling for embedded systems
- In Proc. (CODES+ISSS) 2003
, 2003
"... Pareto-set-based optimization can be found in several different areas of embedded system design. One example is task scheduling, where different task mapping and ordering choices for a target platform will lead to different performance/cost tradeoffs. To explore this design space at runtime, a fast ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
are studied. Compared to the optimal dynamic programming solver, the heuristic is more than ten times faster while the result is less than 5 % away from the optimum. Moreover, due to its iterative feature, the algorithm is well suitable to be used as an on-line algorithm.
Bin Packing with conflicts: a generic branch-and-price algorithm
- INFORMS Journal on Computing
, 2012
"... The bin packing problem with conflicts consists in packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates that a generic implementation of a Branch-and-Price algorithm using specific pricing oracle yields c ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
comparatively good performance for this problem. We use our black-box Branch-and-Price solver BaPCod, relying on its generic branching scheme and primal heuristics. We developed a dynamic programming algorithm for pricing when the conflict graph is an interval graph, and a depth-first-search branch
Energy Efficient Intra-Task Dynamic Voltage Scaling for Realistic CPUs of Mobile Devices
, 2009
"... It is not energy efficient to run a CPU at full speed all the time for all kinds of tasks in mobile devices. This paper proposes two energy efficient intra-task dynamic voltage scaling (DVS) algorithms for CPUs. There are three main contributions in this paper. Firstly, unlike the tedious derivation ..."
Abstract
- Add to MetaCart
to the Multiple-Choice Knapsack Problem (MCKP). Since the problem can be described by a multistage graph, we used dynamic programming to derive an Optimal Schedule for Realistic CPUs (OSRC) with minimal energy consumption for realistic CPUs by using actual power consumption specifications of realistic CPUs
Optimization methods for decision making in disease prevention and epidemic control
"... Keywords: Disease prevention and intervention Dynamic programming 0-1 Knapsack problem Compensatory behavior modeling Dynamic/static disease control a b s t r a c t This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i) va ..."
Abstract
- Add to MetaCart
Keywords: Disease prevention and intervention Dynamic programming 0-1 Knapsack problem Compensatory behavior modeling Dynamic/static disease control a b s t r a c t This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i
