Journal: INFORMS Journal On Computing

Found 560 papers in total
Conditions that obviate the no-free-lunch theorems for optimization
Conditions that obviate the no-free-lunch theorems for optimization
2007,
Roughly speaking, the no–free–lunch (NFL) theorems state that any blackbox...
A survey and experimental comparison of service-level-approximation methods for nonstationary M(t)/M/s(t) queueing systems with exhaustive discipline
A survey and experimental comparison of service-level-approximation methods for nonstationary M(t)/M/s(t) queueing systems with exhaustive discipline
2007,
We compare the performance of seven methods in computing or approximating service...
An evolutionary metaheuristic for approximating preference-nondominated solutions
An evolutionary metaheuristic for approximating preference-nondominated solutions
2007,
We propose an evolutionary metaheuristic for approximating the...
Efficient computation of overlapping variance estimators for simulation
Efficient computation of overlapping variance estimators for simulation
2007,
For a steady–state simulation output process, we formulate efficient algorithms...
Power algorithms for inverting Laplace transforms
Power algorithms for inverting Laplace transforms
2007,
This paper investigates ways to create algorithms to invert Laplace transforms...
Computing with domino-parity inequalities for the traveling salesman problem (TSP)
Computing with domino-parity inequalities for the traveling salesman problem (TSP)
2007,
We describe methods for implementing separation algorithms for domino–parity...
An optimization framework for conformal radiation treatment planning
An optimization framework for conformal radiation treatment planning
2007,
An optimization framework for three–dimensional conformal radiation therapy is...
A study on the cross-entropy method for rare-event probability estimation
A study on the cross-entropy method for rare-event probability estimation
2007,
We discuss the problem of estimating probabilities of rare events in static simulation...
Denser packings obtained in o(n log log n) time
Denser packings obtained in o(n log log n) time
2007,
The placement problem is that of packing a set of rectangles into a minimum–area...
On a binary-encoded ILP coloring formulation
On a binary-encoded ILP coloring formulation
2007,
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors...
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
2007,
The fleet–assignment model (FAM) for an airline assigns fleet types to the set...
A decomposition and guided simulation methodology for large-scale system design: A study in QoS-capable intranets with fixed and mobile components
A decomposition and guided simulation methodology for large-scale system design: A study in QoS-capable intranets with fixed and mobile components
2007,
Integrated design of a large–scale distributed system is challenging due to...
A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
2007,
The vehicle routing problem with time windows (VRPTW) is an important problem in...
Tariff optimization in networks
Tariff optimization in networks
2007,
We consider the problem of determining a set of optimal tariffs for an agent in the...
On the selection of the globally optimal prototype subset for nearest‐neighbor classification
On the selection of the globally optimal prototype subset for nearest‐neighbor classification
2007,
The nearest–neighbor classifier has been shown to be a powerful tool for...
Efficient computations for the discrete GI/G/1 system
Efficient computations for the discrete GI/G/1 system
2007,
We consider the discrete–time GI/G/1 system with discrete interarrival...
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
2007,
We consider nondifferentiable optimization problems that arise when solving Lagrangian...
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints
2007,
The multi–period single–sourcing problem that we address in this paper can...
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
2007,
The primary objective in cutting and packing problems is trim loss or material input...
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
2007,
The two–dimensional bin–packing problem is the problem of orthogonally...
Performance Guarantees of Local Search for Multiprocessor Scheduling
Performance Guarantees of Local Search for Multiprocessor Scheduling
2007,
Increasing interest has recently been shown in analyzing the worst–case behavior...
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
2007,
We consider a two–machine flowshop–scheduling problem with an unknown...
Linear Complementarity as a General Solution Method to Combinatorial Problems
Linear Complementarity as a General Solution Method to Combinatorial Problems
2007,
This paper shows how many types of combinatorial problems can be embedded in...
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
2007,
This paper describes a variant of simulated annealing incorporating a variable penalty...
Papers per page: