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
Isotonic separation
2005,
Chandrasekaran R.
Data classification and prediction problems are prevalent in many domains. The need to...
A general heuristic for production planning problems
2004,
Pochet Yves
We consider production planning problems with the restriction that all integer...
Effective role resolution in workflow management
2005,
Zhao J. Leon
Workflow systems provide the key technology to enable business-process automation. One...
A branch-and-cut approach for a generic multiple-product, assembly-system design problem
2004,
Wilhelm Wilbert E.
This paper presents two new models to deal with different tooling requirements in the...
Computer-aided complexity classification of dial-a-ride problem
2004,
Lenstra Jan Karel
In dial-a-ride problems, items have to be transported from a source to a destination....
A GRASP for parallel machine scheduling with time windows
2005,
Bard Jonathan F.
This paper presents a greedy randomized adaptive search procedure (GRASP) for...
Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
2005,
Michelon Philippe
We propose a cooperation method between constraint programming and integer programming...
An experimental study of LP-based approximation algorithms for scheduling problems
2005,
Savelsbergh Martin W.P.
Recently there has been much progress on the design of approximation algorithms for a...
Near-optimal solutions of large-scale single-machine scheduling problems
2005,
Avella Pasquale
The single-machine scheduling problem (SMSP) with release dates concerns the optimal...
Lower bounds for the head–body–tail problem on parallel machines: A computational study of the multiprocessor flow shop
2005,
Lenstra Jan Karel
The multiprocessor flow-shop is the generalization of the flow-shop in which each...
An improved augmented neural-network approach for scheduling problems
2006,
Pirkul Hasan
For the task-scheduling problem, we propose an augmented neural-network approach,...
An ejection chain approach for the generalized assignment problem
2004,
Ibaraki Toshihide
We propose a tabu search algorithm for the generalized assignment problem, which is...
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
2004,
Sourd Francis
This paper focuses on the continuous assignment problem with the eventual aim to solve...
Implementing an LU factorization for the embedded network simplex algorithm
2004,
McBride Richard D.
This paper presents an LU factorization specialized for embedded network simplex...
Generalized networks: The theory of preprocessing and an empirical analysis
2004,
Kennington Jeffery L.
The idea of preprocessing a linear program with the goal of eliminating constraints or...
Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem
2004,
Billionnet Alain
In this paper we will consider the 0–1 quadratic knapsack problem (QKP). Our...
An algorithm to compute the waiting time distribution for the M/G/1 queue
2004,
Fischer Martin J.
In many modern applications of queueing theory, the classical assumption of...
Wavelength translation in WDM networks: Optimization models and solution procedures
2004,
Kennington Jeffery L.
Wavelength-division multiplexing (WDM) is the best technology currently available to...
The reversal median problem
2003,
Caprara Alberto
In this paper, we study the Reversal Median Problem (RMP), which arises in...
MINLPLib – A collection of test models for mixed-integer nonlinear programming
2003,
Drud Arne Stolbjerg
The paper describes a new computerized collection of test models for mixed-integer...
A multicommodity network-flow problem with side constraints on paths solved by column generation
2003,
Holmberg Kaj
The multicommodity network-flow model concerns routing of a number of commodities...
Chained Lin–Kernighan for large traveling salesman problems
2003,
Cook William
We discuss several issues that arise in the implementation of Martin, Otto, and...
A framework for the evaluation of session reconstruction heuristics in Web-usage analysis
2003,
Spiliopoulos Myra
Web-usage mining has become the subject of intensive research, as its potential for...
Relationship-based clustering and visualization for high-dimensional data mining
2003,
Strehl Alexander
In several real-life data-mining applications, data reside in very high (1000 or more)...
First Page
8
9
10
11
12
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers