Country: United States

Found 17049 papers in total
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
1998,
Given is an undirected graph with positive or negative edge weights which represent a...
Approximating Steiner trees in graphs with restricted weights
Approximating Steiner trees in graphs with restricted weights
1998,
We analyze the approximation ratio for the average distance heuristic for the Steiner...
A note on the bottleneck graph partition problem
A note on the bottleneck graph partition problem
1999,
The bottleneck graph partition problem consists of partitioning the vertices of an...
Intermediate performance impacts of advanced manufacturing technology systems: An empirical investigation
Intermediate performance impacts of advanced manufacturing technology systems: An empirical investigation
1999,
A large-scale random sample is used to empirically examine the relationships between...
Optimal edge coloring of large graphs
Optimal edge coloring of large graphs
1999,
Most of the general families of large considered graphs in the context of the...
Information-processing alternatives for coping with manufacturing environment complexity
Information-processing alternatives for coping with manufacturing environment complexity
1999,
Investment in information systems and technology is often justified as a necessary...
Analysis of LP relaxations for multiway and multicut problems
Analysis of LP relaxations for multiway and multicut problems
1999,
We introduce in this paper an exact nonlinear formulation of the multiway cut problem....
A performance measure for software reuse projects
A performance measure for software reuse projects
1999,
The efficient development of software has become a critical factor to the success of...
A tabu search heuristic for the Steiner tree problem
A tabu search heuristic for the Steiner tree problem
1999,
The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has...
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
1999,
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called...
On Steiner centers and Steiner medians of graphs
On Steiner centers and Steiner medians of graphs
1999,
Let G be connected graph and S a set of vertices of G . Then a Steiner tree for S is a...
Center, median, and centroid subgraphs
Center, median, and centroid subgraphs
1999,
The median and centroid of an arbitrary graph G are two different generalizations of...
A branch and cut algorithm for the Steiner problem in graphs
A branch and cut algorithm for the Steiner problem in graphs
1998,
In this paper, we consider the Steiner problem in graphs, which is the problem of...
Supporting quick response through scheduling of make-to-stock production/inventory systems
Supporting quick response through scheduling of make-to-stock production/inventory systems
1999,
Scheduling of traditional job shops in make-to-order systems has seen extensive...
Product positioning and pricing under production cost considerations
Product positioning and pricing under production cost considerations
1999,
A framework in a competitive environment is proposed that incorporates production cost...
Two-timescale algorithms for simulation optimization of hidden Markov models
Two-timescale algorithms for simulation optimization of hidden Markov models
2001,
We propose two finite difference two-timescale Simultaneous Perturbation Stochastic...
Modeling presentations at national conventions
Modeling presentations at national conventions
1997,
Organizing the presentations at professional meetings or society meetings is a chore...
A solution to the hub center problem via a single-relocation algorithm with tabu search
A solution to the hub center problem via a single-relocation algorithm with tabu search
2001,
Network designers for many transportation or telecommunication applications need to...
A strong lower bound for the node weighted Steiner tree problem
A strong lower bound for the node weighted Steiner tree problem
1998,
In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is...
Process network synthesis: Problem definition
Process network synthesis: Problem definition
1998,
Analyses of network problems have yielded mathematically and practically significant...
Hub network games
Hub network games
1998,
In hub communication networks, a certain subset of focal nodes (i.e., hubs) is fully...
How to test a tree
How to test a tree
1998,
We address the problem of verifying that a tree is connected using probe operations...
Solving Steiner tree problems in graphs to optimality
Solving Steiner tree problems in graphs to optimality
1998,
In this paper, we present the implementation of a branch-and-cut algorithm for solving...
Optimum requirement spanning trees and reliability of tree networks
Optimum requirement spanning trees and reliability of tree networks
1999,
In this paper, an explicit solution of the optimum requirement spanning tree, studied...
Papers per page: