Journal: Networks

Found 487 papers in total
Solving the all-pair shortest path query problem on interval and circular-arc graphs
Solving the all-pair shortest path query problem on interval and circular-arc graphs
1998,
In this paper, we study the following all-pair shortest path query problem: Given the...
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
1998,
In this paper, we examine complexity issues, models, and algorithms for the problem of...
The probabilistic longest path problem
The probabilistic longest path problem
1999,
We study the probabilistic longest path problem. We propose a modification strategy...
Upper and lower bounds for the average-case complexity of path-search
Upper and lower bounds for the average-case complexity of path-search
1999,
A channel graph is the union of all paths between a given input and a given output in...
Path problems in networks with vector-valued edge weights
Path problems in networks with vector-valued edge weights
1999,
We consider path problems in networks where each edge is associated with a vector of...
An efficient implementation of an algorithm for finding K shortest simple paths
An efficient implementation of an algorithm for finding K shortest simple paths
1999,
In this article, we present an efficient computational implementation of an algorithm...
On crossings, the crossing postman problem, and the rural postman problem
On crossings, the crossing postman problem, and the rural postman problem
1999,
The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing...
The assignment problem with external interactions
The assignment problem with external interactions
1997,
The classical assignment problem matches n jobs to n machines in a way that minimizes...
Feasibility in transportation networks with supply eating arcs
Feasibility in transportation networks with supply eating arcs
1998,
In this paper, we consider a special case of a new type of mixed integer programming...
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
1998,
The tree knapsack problem (TKP) is a generalized 0–1 knapsack problem where all...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998,
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
Proportional lot sizing and scheduling: Some extensions
Proportional lot sizing and scheduling: Some extensions
1998,
This contribution generalizes the work of Drexl and Haase about the so-called...
Location problems with grouped structure of demand: Complexity and algorithms
Location problems with grouped structure of demand: Complexity and algorithms
1998,
We study generalizations of classical multifacility location problems, where...
Minmax-regret robust 1-median location on a tree
Minmax-regret robust 1-median location on a tree
1998,
This paper considers the minmax-regret 1-median problem on a tree network where edge...
A polynomial algorithm for the p-centdian problem on a tree
A polynomial algorithm for the p-centdian problem on a tree
1998,
The most common problems studied in network location theory are the p -median and the...
Multicriteria network location problems with sum objectives
Multicriteria network location problems with sum objectives
1999,
In this paper, network location problems with several objectives are discussed, where...
An optimal algorithm for layered wheel floorplan designs
An optimal algorithm for layered wheel floorplan designs
1999,
In this paper, we present an efficient algorithm to solve the orientation optimization...
Locations on time-varying networks
Locations on time-varying networks
1999,
We begin by examining the dynamic behavior of a facility location such as a 1-median...
A unified approach to network location problems
A unified approach to network location problems
1999,
In this paper, we introduce a new type of single-facility location problem on networks...
Eulerian location problems
Eulerian location problems
1999,
The problem of locating a set of depots in an arc routing context (with no side...
Restricted delivery problems on a network
Restricted delivery problems on a network
1997,
We consider a delivery problem on a network in which nodes have supplies or demands...
Scheduling in broadcast networks
Scheduling in broadcast networks
1998,
Broadcasting in a communications network has been the subject of many studies in...
Project scheduling with multiple modes: A comparison of exact algorithms
Project scheduling with multiple modes: A comparison of exact algorithms
1998,
This paper is devoted to a comparison of all available branch-and-bound algorithms...
Optimal adaptive fault diagnosis for simple multiprocessor systems
Optimal adaptive fault diagnosis for simple multiprocessor systems
1999,
We studied adaptive system-level fault diagnosis for multiprocessor systems....
Papers per page: