Journal: INFORMS Journal on Computing

Found 247 papers in total
Branch‐and‐Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed‐Charge Network Flow Problem
Branch‐and‐Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed‐Charge Network Flow Problem
2013,
We develop an exact algorithm for integer programs that uses restrictions of the...
Rapid Screening Procedures for Zero‐One Optimization via Simulation
Rapid Screening Procedures for Zero‐One Optimization via Simulation
2013,
Some existing simulation optimization algorithms (e.g., adaptive random search) become...
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip‐Packing Problem
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip‐Packing Problem
2013,
This paper presents a binary search heuristic algorithm for the rectangular...
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
2013,
This paper presents a genetic algorithm (GA) for solving the traveling salesman...
Expected Tardiness Computations in Multiclass Priority M/M/c Queues
Expected Tardiness Computations in Multiclass Priority M/M/c Queues
2013,
We discuss the evaluation of expected tardiness of an order at the time of arrival in...
An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques
An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques
2013,
We consider the problem of approximating Pareto surfaces of convex multicriteria...
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network
2013,
A network simplex algorithm is described for the minimum‐cost network flow...
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
2013,
Given a graph with nonnegative edge weights and node pairs Q , we study the problem of...
Max‐k‐Cut by the Discrete Dynamic Convexized Method
Max‐k‐Cut by the Discrete Dynamic Convexized Method
2013,
In this paper, we propose a ‘multistart‐type’ algorithm for solving...
A Branch‐and‐Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
A Branch‐and‐Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
2013,
The double traveling salesman problem with multiple stacks is a variant of the pickup...
Static Network Reliability Estimation via Generalized Splitting
Static Network Reliability Estimation via Generalized Splitting
2013,
We propose a novel simulation‐based method that exploits a generalized...
A New Graph‐Theoretical Model for the Guillotine‐Cutting Problem
A New Graph‐Theoretical Model for the Guillotine‐Cutting Problem
2013,
We consider the problem of determining whether a given set of rectangular items can be...
Rational Automata Networks: A Non‐Markovian Modeling Approach
Rational Automata Networks: A Non‐Markovian Modeling Approach
2013,
A new class of non‐Markovian models is introduced that results from the...
Assessing the Value of Dynamic Pricing in Network Revenue Management
Assessing the Value of Dynamic Pricing in Network Revenue Management
2013,
Dynamic pricing for a network of resources over a finite selling horizon has received...
Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand
Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand
2013,
We formulate and solve two new stochastic linear programming formulations of...
An Adaptive Hyperbox Algorithm for High‐Dimensional Discrete Optimization via Simulation Problems
An Adaptive Hyperbox Algorithm for High‐Dimensional Discrete Optimization via Simulation Problems
2013,
We propose an adaptive hyperbox algorithm (AHA), which is an instance of a locally...
Convex Approximations of a Probabilistic Bicriteria Model with Disruptions
Convex Approximations of a Probabilistic Bicriteria Model with Disruptions
2013,
We consider a multiperiod system operation problem with two conflicting objectives,...
Discovery of Online Shopping Patterns Across Websites
Discovery of Online Shopping Patterns Across Websites
2013,
In the online world, customers can easily navigate to different online stores to make...
Steady‐State Simulation with Replication‐Dependent Initial Transients: Analysis and Examples
Steady‐State Simulation with Replication‐Dependent Initial Transients: Analysis and Examples
2013,
The replicated batch means (RBM) method for steady‐state simulation output...
Quantifying the Trade‐off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization
Quantifying the Trade‐off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization
2012,
Beam‐on time is an important measure of the delivery efficiency in...
The Generalized Covering Salesman Problem
The Generalized Covering Salesman Problem
2012,
Given a graph G = ( N , E ), the covering salesman problem (CSP) is to identify the...
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
2012,
This paper describes a generic branch‐and‐cut algorithm applicable to...
Dividing a Territory Among Several Vehicles
Dividing a Territory Among Several Vehicles
2012,
We consider an uncapacitated stochastic vehicle routing problem in which vehicle depot...
The Fixed‐Charge Shortest‐Path Problem
The Fixed‐Charge Shortest‐Path Problem
2012,
Consider a network 𝒩 =( N , A ) and associate with each arc e ∈ A a fixed...
Papers per page: