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
State-of-the art review–Evolutionary algorithms for vehicle routing
2009,
Potvin Jean-Yves
This paper is a survey of the literature on applications of evolutionary algorithms...
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
2008,
Martello Silvano
Given a set of jobs with associated processing times, and a set of identical machines,...
Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights
2008,
Gupta Alok
We develop a real–time estimation approach to predict bidders' maximum...
Improving Intrusion Prevention Models: Dual-Threshold and Dual-Filter Approaches
2008,
Ryu Young U
Intrusion detection, once considered as the last line of defense in the layered...
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
2008,
Crainic Teodor Gabriel
One of the main issues in addressing three–dimensional packing problems is...
Efficient Jump Ahead for 𝔽2-Linear Random Number Generators
2008,
L'Ecuyer Pierre
The fastest long–period random number generators currently available are based...
Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price
2008,
Gupta Rakesh
Packet radio networks use spatial time–division multiple–access to enable...
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
2008,
Andersen Kim Allan
We consider the bicriterion multimodal assignment problem, which is a new...
A Maximal-Space Algorithm for the Container Loading Problem
2008,
AlvarezValdes R
In this paper, a greedy randomized adaptive search procedure (GRASP) for the container...
Tabu Search-Enhanced Graphical Models for Classification in High Dimensions
2008,
Padman Rema
Data sets with many discrete variables and relatively few cases arise in health care,...
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
2008,
Ahmed Shabbir
This paper develops a linear–programming–based...
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
2008,
Ruiz Rubn
This paper contains a complete and updated review of the literature for multiobjective...
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
2008,
Sourd Francis
This paper focuses on a multiobjective derivation of branch–and–bound...
Evaluation of the ARTAFIT Method for Fitting Time-Series Input Processes for Simulation
2008,
Biller Bahar
Time–series input processes occur naturally in the stochastic simulation of many...
Reactive Tabu Search in a Team-Learning Problem
2008,
Shen Yuelin
In designing an MBA core curriculum, student cohorts are assigned to a number of...
Approximation to the Transient Solution of the M/Ek/1 Queue
2008,
Griffiths J D
This paper considers the Erlang queueing system M/Ek/1, where customers arrive...
Disk Packing in a Square: A New Global Optimization Approach
2008,
Addis B
We present a new computational approach to the problem of placing n identical...
Kestrel: An Interface from Optimization Modeling Systems to the NEOS Server
2008,
Fourer Robert
The NEOS server provides access to a variety of optimization resources via the...
Top-k φ Correlation Computation
2008,
Xiong Hui
Recently, there has been considerable interest in efficiently computing strongly...
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
2008,
Andreas April K
Most traditional routing problems assume perfect operability of all arcs and nodes....
An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems
2008,
Subramanian Shivaram
We present a new deflected subgradient scheme for generating good quality dual...
Efficient Simulation Budget Allocation for Selecting an Optimal Subset
2008,
Lee Loo Hay
We consider a class of the subset selection problem in ranking and selection. The...
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
2008,
Topaloglu Huseyin
We present a stochastic approximation method to compute bid prices in network revenue...
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
2008,
Vannelli Anthony
This paper is concerned with the single–row facility layout problem (SRFLP). A...
1
2
3
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers