Country: United States

Found 17049 papers in total
Constraint aggregation in infinite-dimensional spaces and applications
2001,
An aggregation technique for constraints with values in Hilbert spaces is suggested....
On the throughput of a resource sharing model
2001,
A stochastic model of a parallel system with synchronization constraints is analyzed...
How stringent is the linear independence assumption for mathematical programs with complementarity constraints?
2001,
The linear independence constraint qualifications (LICQ) plays an important role in...
Modeling, scheduling and control of flexible manufacturing systems by extended high-level evaluation Petri nets
1997,
This paper proposes an extended high level evaluation Petri net (EHLEP-N) for modeling...
An epsilon-out-of-kilter method for monotropic programming
2001,
The out-of-kilter method was first proposed by Fulkerson for linear-cost network flow...
Global methods for nonlinear complementarity problems
1996,
Global methods for nonlinear complementarity problems formulate the problem as a...
Properties of an interior-point mapping for mixed complementarity problems
1996,
Using a unified theory of local homeomorphic maps, we establish some basic properties...
Barrier functions in interior point methods
1996,
We show that the universal barrier function of a convex cone introduced by Nesterov...
On a new homotopy continuation trajectory for nonlinear complementarity problems
2001,
Most known continuation methods for P 0 complementarity problems require some...
Risk, ambiguity, and the separation of utility and beliefs
2001,
We introduce a general model of static choice under uncertainty, arguably the weakest...
Convergence analysis of stochastic algorithms
1996,
This paper investigates asymptotic convergence to stationary points of gradient...
Proposing an architectural framework of a hybrid knowledge-based system for production rescheduling
1999,
An architectural configuration of a knowledge-based system for production rescheduling...
Developing a neural network approach for intelligent scheduling in GUESS
2000,
The generically used expert scheduling system (GUESS) intelligent scheduling toolkit...
On polyhedral approximations of the second-order cone
2001,
We demonstrate that a conic quadratic problem, (CQP) --> -->min --> -->x --> -->{e T...
Design of efficient hybrid neural networks for flexible flow shop scheduling
2003,
Although neural networks have been successfully used in performing pattern...
A comparison of solution approaches for the fixed-sequence economic lot scheduling problem
1997,
The economic lot scheduling problem (ELSP) has received much attention recently. The...
A new and efficient ant-based heuristic method for solving the traveling salesman problem
2003,
In this paper, we present an efficient metaheuristic approach for solving the problem...
The symmetric traveling salesman polytope revisited
2001,
In this paper we present a tour of the symmetric traveling salesman polytope, focusing...
A resource-based view of strategic Information Technology alignment: How knowledge sharing creates competitive advantage
2003,
A critical decision problem for top management, and the focus of this study, is...
The impact of information system personnel skill discrepancies on stakeholder satisfaction
2003,
System development efforts depend to a large degree upon how well information systems...
On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers
1996,
A long-standing conjecture on the optimal Bernoulli routing policy is proven to be...
Diffusion approximations for some multiclass queueing networks with first-in-first-out service disciplines
2000,
The diffusion approximation is proved for a class of multiclass queueing networks...
Periodic orbits in a class of re-entrant manufacturing systems
2000,
Queue changes associated with each step of a manufacturing system are modeled by...
Buffer requirements and server ordering in a tandem queue with correlated service times
2001,
We analyze the intermediate buffer requirements in a tandem queue where service times...
Papers per page: