Country: United States

Found 17049 papers in total
An empirical study of the impact of just-in-time task scope versus just-in-time workflow integration on organizational design
An empirical study of the impact of just-in-time task scope versus just-in-time workflow integration on organizational design
1997,
The research tests a theory of JIT as a technology having task scope versus workflow...
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
1999,
We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow...
Minmax regret median location on a network under uncertainty
Minmax regret median location on a network under uncertainty
2000,
We consider the 1-median problem on a network with uncertain weights of nodes....
Algorithms for path-based placement of inspection stations on networks
Algorithms for path-based placement of inspection stations on networks
2000,
Placement of inspection stations is a common task in transportation and communication...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999,
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
2000,
Computing Laplace transforms for numerical inversion via continued fractions
Computing Laplace transforms for numerical inversion via continued fractions
1999,
It is often possible to effectively calculate probability density functions (pdfs) and...
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
1999,
This article introduces two new techniques for solving the Quadratic Assignment...
A stochastic branch-and-bound approach to activity crashing in project management
A stochastic branch-and-bound approach to activity crashing in project management
2000,
Many applications such as project scheduling, workflow modeling, or business process...
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
2000,
We derive results of the following flavor: If a combinatorial optimization problem can...
A minimal algorithm for the bounded knapsack problem
A minimal algorithm for the bounded knapsack problem
2000,
The Bounded Knapsack Problem (BKP) is a generalization of the 0–1 Knapsack...
Progress in linear programming-based algorithms for integer programming: An exposition
Progress in linear programming-based algorithms for integer programming: An exposition
2000,
This paper is about modeling and solving mixed integer programming problems. In the...
A new algebraic geometry algorithm for integer programming
A new algebraic geometry algorithm for integer programming
2000,
We propose a new algorithm for solving integer programming (IP) problems that is based...
An Introduction to Linear Optimization
An Introduction to Linear Optimization
2000,
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
2000,
Postoptimality or sensitivity analysis are well-developed subjects in almost all...
Propagation of interval values in simple processing networks
Propagation of interval values in simple processing networks
1999,
Process network optimization problems are prevalent in the processing industries....
A fuzzy Hopfield–Tank traveling salesman problem model
A fuzzy Hopfield–Tank traveling salesman problem model
1999,
This article describes a Hopfield–Tank model of the Euclidean traveling salesman...
A heavy traffic approximation for workload processes with heavy tailed service requirements
A heavy traffic approximation for workload processes with heavy tailed service requirements
2000,
A system with heavy tailed service requirements under heavy load having a single...
Price and service discrimination in queuing systems: Incentive compatibility of Gcμ scheduling
Price and service discrimination in queuing systems: Incentive compatibility of Gcμ scheduling
2000,
This article studies the optimal prices and service quality grades that a queuing...
Path generation for quasi-Monte Carlo simulation of mortgage-backed securities
Path generation for quasi-Monte Carlo simulation of mortgage-backed securities
2000,
Monte Carlo simulation is playing an increasingly important role in the pricing and...
Fostering risk taking in research and development: The importance of a project's terminal value
Fostering risk taking in research and development: The importance of a project's terminal value
1998,
Large firms face a conflict in managing a portfolio of high-risk projects. When an...
A risk-sharing approach to transfer pricing and incentive compensation problems under exchange rate uncertainty
A risk-sharing approach to transfer pricing and incentive compensation problems under exchange rate uncertainty
1998,
This study examines the transfer pricing and incentive compensation problems in a...
Managing in Uncertainty: Theory and Practice
Managing in Uncertainty: Theory and Practice
2000,
Shape – a stochastic hybrid approximation procedure for two-stage stochastic programs
Shape – a stochastic hybrid approximation procedure for two-stage stochastic programs
2000,
We consider the problem of approximating the expected recourse function for two-stage...
Papers per page: