Country: United States

Found 17049 papers in total
New polynomial-time cycle-canceling algorithms for minimum-cost flows
New polynomial-time cycle-canceling algorithms for minimum-cost flows
2000,
The cycle-canceling algorithm is one of the earliest algorithms to solve the...
Robust path choice in networks with failures
Robust path choice in networks with failures
2000,
The problem of adaptive routing in a network with failures is considered. The network...
The cardinality-constrained shortest path problem in 2-graphs
The cardinality-constrained shortest path problem in 2-graphs
2000,
We study the cardinality-constrained shortest path problem in acyclic graphs and, in...
The effect of misclassification costs on neural network classifiers
The effect of misclassification costs on neural network classifiers
1999,
The potential of neural networks for classification problems has been established by...
Competition in remanufacturing
Competition in remanufacturing
2001,
We present a two-period model of remanufacturing in the face of competition. In our...
A general framework for functional networks
A general framework for functional networks
2000,
In this paper, we introduce functional networks as a generalization and extension of...
Managing product returns for remanufacturing
Managing product returns for remanufacturing
2002,
Firms are often encouraged to offer environmentally friendly products as a...
The conference paper-reviewer assignment problem
The conference paper-reviewer assignment problem
1999,
Conference organizers often face the following problem: Given a collection of...
Progress in dynamic programming search for large-vocabulary continuous speech recognition
Progress in dynamic programming search for large-vocabulary continuous speech recognition
2000,
Initially introduced in the late 1960s and early 1970s, dynamic programming algorithms...
Material planning for a remanufacturing facility
Material planning for a remanufacturing facility
2001,
This article describes the first fully integrated material planning system to...
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
Improved criteria for identifying optimal basic and nonbasic variables in linear programming
2001,
We derive new criteria for identifying whether a variable is basic or nonbasic for...
A truncated primal-infeasible dual-feasible network interior point mathod
A truncated primal-infeasible dual-feasible network interior point mathod
2000,
In this paper, we introduce the truncated primal-infeasible dual-feasible interior...
Operationalizing and testing normal accident theory in petrochemical plants and refineries
Operationalizing and testing normal accident theory in petrochemical plants and refineries
2001,
Since ‘Normal Accidents: Living With High-Risk Technologies’ was first...
Replanning the master production schedule for a capacity-constrained job shop
Replanning the master production schedule for a capacity-constrained job shop
1999,
This research examines the use of both frozen and replanning intervals for planning...
A polyhedral study of the asymmetric traveling salesman problem with time windows
A polyhedral study of the asymmetric traveling salesman problem with time windows
2000,
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model...
Priority queues and multisets
Priority queues and multisets
1995,
A priority queue, a container data structure equipped with the operations insert and...
A data envelopment analysis framework to assess the efficiency of the software requirements capture and analysis process
A data envelopment analysis framework to assess the efficiency of the software requirements capture and analysis process
1999,
In this paper a theoretical framework to assess the efficiency of the Requirements...
Scheduling to improve field service quality
Scheduling to improve field service quality
1999,
This research addresses the problem of scheduling technicians to travel from customer...
Selling to the newsvendor: An analysis of price-only contracts
Selling to the newsvendor: An analysis of price-only contracts
2001,
We consider a simple supply-chain contract in which a manufacturer sells to a retailer...
Efficient modeling of travel in networks with time-varying link speeds
Efficient modeling of travel in networks with time-varying link speeds
2000,
This paper investigates exact and approximate methods for estimating time-minimizing...
Optimization of feeding profile for baker's yeast production by dynamic programming
Optimization of feeding profile for baker's yeast production by dynamic programming
1999,
An optimal substrate feeding for an industrial scale fed-batch fermenter is determined...
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
2000,
In this paper, we deal with a network design problem arising from the deployment of...
Optimizing natural gas flows with linear programming and scenarios
Optimizing natural gas flows with linear programming and scenarios
1999,
Recently, we developed a linear programming model to aid an electric utility company...
Agility in retail banking: A numerical taxonomy of strategic service groups
Agility in retail banking: A numerical taxonomy of strategic service groups
2001,
This research demonstrates that operations agility – defined as the ability to...
Papers per page: