Keyword: networks

Found 1865 papers in total
A graph theory-based approach for partitioning knowledge bases
A graph theory-based approach for partitioning knowledge bases
1995,
The growing interest in using structured methodologies for design and development is a...
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
1997,
The Tree Knapsack Problem (TKP) can be regarded as a 0–1 knapsack problem on a...
A note on convergence in the single facility minisum location problem
A note on convergence in the single facility minisum location problem
1998,
The single facility minisum location problem requires finding a point in R N that...
Experience with a cutting plane algorithm for the capacitated spanning tree problem
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
A basic problem in telecommunications network design is that of designing a...
Making a case for robust optimization models
Making a case for robust optimization models
1997,
Robust optimization searches for recommendations that are relatively immune to...
Expressing special structures in an algebraic modeling language for mathematical programming
Expressing special structures in an algebraic modeling language for mathematical programming
1995,
A knowledge of the presence of certain special structures can be advantageous in both...
Preprocessing in stochastic programming: The case of capacitated networks
Preprocessing in stochastic programming: The case of capacitated networks
1995,
We investigate different preprocessing procedures for stochastic linear programs whose...
The theory of networks of single server queues and the tandem queue model
The theory of networks of single server queues and the tandem queue model
1997,
We consider the stochastic behavior of networks of single server queues when...
Closed queueing networks and zeros of successive derivative
Closed queueing networks and zeros of successive derivative
1997,
Consider a Jackson type closed queueing network in which each queue has a single...
Schedule optimization at SNCF: From conception to day of departure
Schedule optimization at SNCF: From conception to day of departure
1998,
Because of the upcoming deregulation and the advent of high-speed rail networks,...
On cent-dians of general networks
On cent-dians of general networks
1997,
Most classical location studies focus on the minimisation of the average distance or...
Modeling the domestic distribution network for illicit drugs
Modeling the domestic distribution network for illicit drugs
1997,
This paper presents a simple economic model of a drug dealer's decision about how many...
Use of representative operation counts in computational testing of algorithms
Use of representative operation counts in computational testing of algorithms
1996,
In the mathematical programming literature, researchers have conducted a large number...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996,
We propose an algorithm to solve the bottleneck spanning tree problem with an...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996,
This paper deals with a Steiner tree-star problem that is a special case of the degree...
The multi-tier tree problem
The multi-tier tree problem
1996,
This paper studies the multi-tier tree (MTT) problem, a generalization of the...
Deadhead selection for the long-haul crew pairing problem
Deadhead selection for the long-haul crew pairing problem
1995,
The long-haul crew pairing problem involves the assignment of crews to scheduled...
Two-person zero-sum games for network interdiction
Two-person zero-sum games for network interdiction
1995,
A single evader attempts to traverse a path between two nodes in a network while a...
Fast clustering algorithms
Fast clustering algorithms
1994,
This paper considers the problem of partitioning the vertices of a weighted complete...
Network configuration and machine layout in fixed-path material handling systems
Network configuration and machine layout in fixed-path material handling systems
1998,
In this paper, we address a difficult combinatorial problem that arises in designing...
A decomposition algorithm for local access telecommunications network expansion planning
A decomposition algorithm for local access telecommunications network expansion planning
1995,
Growing demand, increasing diversity of services, and advances in transmission and...
Lower bounding procedures for multiperiod telecommunications network expansion problems
Lower bounding procedures for multiperiod telecommunications network expansion problems
1995,
This paper suggests an improved formulation for the multiperiod network topology and...
Balanced bisubmodular systems and bidirected flows
Balanced bisubmodular systems and bidirected flows
1997,
For a nonempty finite set V let 3 V be the set of all the ordered pairs of disjoint...
An asynchronous block-parallel algorithm for separable quadratic programming problems
An asynchronous block-parallel algorithm for separable quadratic programming problems
1997,
An asynchronous modification of the block-parallel algorithm is presented for...
Papers per page: