Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: INFORMS Journal On Computing
Found
560 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Primal–dual and primal interior point algorithms for general nonlinear programs
1995,
Lasdon Leon S.
An interior point algorithm for general nonlinear programs is presented. Inequality...
Genetic algorithms for the operations researcher
1997,
Reeves Colin R.
Genetic algorithms have become increasingly popular as a means of solving hard...
Placing text labels on maps and diagrams using genetic algorithms with masking
1997,
Verner Oleg V.
Cartographic label placement is one of the most time-consuming tasks in the production...
A generalized univariate change-of-variable transformation technique
1997,
Leemis Lawrence M.
We present a generalized version of the univariate change-of-variable technique for...
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
1997,
Cho Geon
The Tree Knapsack Problem (TKP) can be regarded as a 0–1 knapsack problem on a...
On the application of explanation-based learning to acquire control knowledge for branch and bound algorithms
1998,
Realff Matthew J.
The goal of this article is to present a methodology for the automatic acquisition of...
Finding a useful subset of constraints for analysis in an infeasible linear program
1997,
Chinneck John W.
Infeasibility is often encountered during the process of intial model formulation or...
Sparse matrix ordering methods for interior point linear programming
1998,
Rothberg Edward
The main cost of solving a linear programming problem using an interior point method...
A parametric optimization method for machine learning
1997,
Bennett Kristin P.
The classification problem of constructing a plane to separate the members of two sets...
Load balancing in hypercube solution of stochastic optimization problems
1995,
Berland Nils Jacob
In some stochastic optimization problems the error bounds computed for the expected...
Stochastic programming computation and applications
1997,
Birge John R.
Although decisions frequently have uncertain consequences, optimal-decision models...
Estimating waiting times from transactional data
1997,
Servi L.D.
Given transactional data consisting of service starting and finishing times in a...
An automatic approach to deadlock detection and resolution in discrete simulation systems
1997,
Deuermeyer Bryan L.
In this article we develop an automatic deadlock detection scheme for general purpose...
An implementation of the lattice and spectral tests for multiple recursive linear random number generators
1997,
L'Ecuyer Pierre
We discuss the implementation of theoretical tests to assess the structural properties...
Numerical methods for fitting and simulating Autoregressive-to-Anything Processes
1998,
Nelson Barry L.
An ARTA (AutoRegressive-to-Anything) Process is a time series with arbitrary marginal...
Complexity of simulation models: A graph theoretic approach
1998,
Schruben Lee
In this article, we introduce complexity measures for simulation models. The framework...
An implementation of the batch means method
1997,
Fishman George S.
This article introduces the LBATCH and ABATCH rules for applying the batch means...
OR/SM: A prototype integrated modeling environment based on structured modeling
1997,
Wright Gordon P.
This article describes the design and implementation of OR/SM, a computerized modeling...
An integrated modeling system for structured modeling using model graphs
1997,
Chari Kaushal
This article presents a graph-based modeling system for structured modeling that...
Spectral analysis of basic Transform-Expand Sample processes
1995,
Melamed Benjamin
This paper studies the spectral properties of a class of stochastic sequences...
SALOME: A bidirectional branch-and-bound procedure for Assembly Line Balancing
1997,
Scholl Armin
In this article, we report on new results for the well-known Simple Assembly Line...
A branch and cut approach for workload smoothing on assembly lines
1997,
Wilhelm Wilbert E.
This article presents a strong cutting plane method implemented by branch and cut to...
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
Hall Leslie
A basic problem in telecommunications network design is that of designing a...
A matching identification problem: A knowledge acquisition approach
1995,
Mehrez Abraham
The paper is concerned with an identification problem of a set of K out of N numbers....
First Page
16
17
18
19
20
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers