Journal: INFORMS Journal On Computing

Found 560 papers in total
Decision-Tree-Based Knowledge Discovery: Single- vs. Multi-Decision-Tree Induction
Decision-Tree-Based Knowledge Discovery: Single- vs. Multi-Decision-Tree Induction
2008,
One widely used knowledge–discovery technique is a decision–tree inducer...
Primal-dual variable neighborhood search for the simple plant-location problem
Primal-dual variable neighborhood search for the simple plant-location problem
2007,
The variable neighborhood search metaheuristic is applied to the primal simple...
Scatter Search for the Point-Matching Problem in 3D Image Registration
Scatter Search for the Point-Matching Problem in 3D Image Registration
2008,
Scatter search is a population–based method that has recently been shown to...
A traffic-grooming algorithm for wavelength-routed optical networks
A traffic-grooming algorithm for wavelength-routed optical networks
2007,
We consider the problem of grooming in all–optical networks to maximize traffic....
A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing
A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing
2008,
We extend Lemke's algorithm to solve a dynamic pricing problem. We identify an...
Asynchronous cooperative local search for the office-space-allocation problem
Asynchronous cooperative local search for the office-space-allocation problem
2007,
We investigate cooperative local search to improve upon known results of the...
A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand
A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand
2008,
A significant amount of work has investigated inventory control problems associated...
Multi-issue automated negotiations using agents
Multi-issue automated negotiations using agents
2007,
Software agents can perform effectively as negotiators in automated negotiation...
Novel Local-Search-Based Approaches to University Examination Timetabling
Novel Local-Search-Based Approaches to University Examination Timetabling
2008,
Examination timetabling assigns examinations to a given number of time slots so that...
A (2/3)n3 fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
A (2/3)n3 fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
2007,
This paper presents a new fast–pivoting algorithm that computes the n Gittins...
A Market Design for Grid Computing
A Market Design for Grid Computing
2008,
Grid computing uses software to integrate computing resources, such as CPU cycles,...
Dynamic programming to minimize the maximum number of open stacks
Dynamic programming to minimize the maximum number of open stacks
2007,
We give a dynamic–programming solution to the problem of minimizing the maximum...
Intrusion-Detection Policies for IT Security Breaches
Intrusion-Detection Policies for IT Security Breaches
2008,
Intrusion–detection systems (IDSs) form an important component of IT security...
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
2007,
This paper addresses a variation of the traveling salesman problem with pickup and...
A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
2008,
A coarse–grained parallel genetic algorithm (PGA) for the multilevel...
Rescheduling for multiple new orders
Rescheduling for multiple new orders
2007,
A set of original jobs has been scheduled on a single machine, but not processed, when...
Time-Indexed Formulations and the Total Weighted Tardiness Problem
Time-Indexed Formulations and the Total Weighted Tardiness Problem
2008,
A solution approach based on the column–generation technique is presented for...
Very large-scale neighborhood search for the quadratic assignment problem
Very large-scale neighborhood search for the quadratic assignment problem
2007,
The quadratic assignment problem (QAP) consists of assigning n facilities to n...
Edge Finding for Cumulative Scheduling
Edge Finding for Cumulative Scheduling
2008,
The introduction of edge–finding techniques was a significant development in...
Solving the bi-objective maximum-flow network-interdiction problem
Solving the bi-objective maximum-flow network-interdiction problem
2007,
We describe a new algorithm for computing the efficient frontier of the...
A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
2008,
We propose a three–step algorithmic framework for solving a new variant of the...
Solution of large quadratic knapsack problems through aggressive reduction
Solution of large quadratic knapsack problems through aggressive reduction
2007,
The quadratic knapsack problem (QKP) calls for maximizing a quadratic objective...
Validation sequence optimization: A theoretical approach
Validation sequence optimization: A theoretical approach
2007,
The need to validate large amounts of data with the help of the domain expert arises...
Pricing communication services with delay guarantee
Pricing communication services with delay guarantee
2007,
Although pricing communication services has received attention, there has been little...
Papers per page: