Results 1  10
of
13
Incrementally Solving the STP by Enforcing Partial Path Consistency
"... The Simple Temporal Problem (STP) appears as a subproblem of many planning and scheduling problems. Recently, we have published a new algorithm to solve the STP, calledP3C, and have showed that it outperformed all existing algorithms. Our approach was based on enforcing partial path consistency (P ..."
Abstract
 Add to MetaCart
(PPC), starting from a chordal constraint graph. When dealing with complex problems, e.g. planning problems, dynamic situations, or the Disjunctive Temporal Problem, it is important to have efficient methods for building up and solving STP instances incrementally. In this paper, we present a brief
P 3 C: A New Algorithm for the Simple Temporal Problem
"... The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse this algo ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse
A method for metric temporal reasoning
 In AAAI/IAAI
, 2002
"... Several methods for temporal reasoning with metric time have been suggested—for instance, Horn Disjunctive Linear Relations (Horn DLRs). However, it has been noted that implementing this algorithm is nontrivial since it builds on fairly complicated polynomialtime algorithms for linear programming ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Several methods for temporal reasoning with metric time have been suggested—for instance, Horn Disjunctive Linear Relations (Horn DLRs). However, it has been noted that implementing this algorithm is nontrivial since it builds on fairly complicated polynomialtime algorithms for linear
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008) P 3 C: A New Algorithm for the Simple Temporal Problem
"... Temporal problem Temporal domain The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In ..."
Abstract
 Add to MetaCart
Temporal problem Temporal domain The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph
Achieving Proportional Delay Differentiation Efficiently
, 2002
"... In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model (PDM) first proposed under the DiffServ framework [3]. Waiting Time Priority (WTP) has been found to be a suitable algorithm to achieve PDD. Using WTP [4] ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model (PDM) first proposed under the DiffServ framework [3]. Waiting Time Priority (WTP) has been found to be a suitable algorithm to achieve PDD. Using WTP [4
An Efficient Tabu Search Heuristic for the School Timetabling Problem
, 2005
"... The School Timetabling Problem (STP) regards the weekly scheduling of encounters between teachers and classes. Since this scheduling must satisfy organizational, pedagogical and personal costs, this problem is recognized as a very difficult combinatorial optimization problem. This work presents a ..."
Abstract
 Add to MetaCart
new Tabu Search (TS) heuristic for STP. Two different memory based diversication strategies are presented. Computational experiments with real world instances, comparing with a previously proposed TS found in the literature, show that the proposed method produces better solutions for all instances
A new partitionbased heuristic for the Steiner tree problem in large graphs
, 2013
"... This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which aims for the efficient construction of approximate solutions in very large graphs. The algorithm is based on a partitioning approach in which instances are divided into several subinstances that are small enoug ..."
Abstract
 Add to MetaCart
This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which aims for the efficient construction of approximate solutions in very large graphs. The algorithm is based on a partitioning approach in which instances are divided into several subinstances that are small
Tractable Monotone Temporal Planning
"... This paper describes a polynomiallysolvable subproblem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each subgoal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monoton ..."
Abstract
 Add to MetaCart
, the monotonicity of subgoal fluents allows us to express planning as an instance of STP ≠ (Simple Temporal Problem, difference constraints). Our class includes temporallyexpressive problems, which we illustrate with an example of chemical process planning.
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
 Eur. J. Oper. Res
, 2014
"... The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop con ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop
unknown title
"... where Pr is the relative pressure of the adsorbate, equal to absolute pressurejsaturation pressure at the temperature of the experiment, Va is the amount adsorbed (cm3 STP gl), and C is the constant whose value depends on the heat of adsorption. Plotting the lefthand side of equation (2) as a func ..."
Abstract
 Add to MetaCart
where Pr is the relative pressure of the adsorbate, equal to absolute pressurejsaturation pressure at the temperature of the experiment, Va is the amount adsorbed (cm3 STP gl), and C is the constant whose value depends on the heat of adsorption. Plotting the lefthand side of equation (2) as a
Results 1  10
of
13