default search action
INFORMS Journal on Computing, Volume 25
Volume 25, Number 1, Winter 2013
- David L. Woodruff:
Message from the Editor. 1
- David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
:
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network. 2-12 - Quentin Botton, Bernard Fortz
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. 13-26 - Wenxing Zhu, Geng Lin, M. Montaz Ali
Max-k-Cut by the Discrete Dynamic Convexized Method. 27-40 - Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. 41-55 - Zdravko I. Botev, Pierre L'Ecuyer
Static Network Reliability Estimation via Generalized Splitting. 56-71 - François Clautiaux, Antoine Jouglet, Aziz Moukrim
A New Graph-Theoretical Model for the Guillotine-Cutting Problem. 72-86 - Peter Buchholz
Rational Automata Networks: A Non-Markovian Modeling Approach. 87-101 - Dan Zhang, Zhaosong Lu
Assessing the Value of Dynamic Pricing in Network Revenue Management. 102-115 - S. Ayca Erdogan, Brian T. Denton:
Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand. 116-132 - Jie Xu, Barry L. Nelson, L. Jeff Hong
An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems. 133-146 - Tara Rengarajan, Nedialko B. Dimitrov, David P. Morton
Convex Approximations of a Probabilistic Bicriteria Model with Disruptions. 147-160 - Yinghui (Catherine) Yang, Hongyan Liu, Yunjue Cai:
Discovery of Online Shopping Patterns Across Websites. 161-176 - Nilay Tanik Argon, Sigrún Andradóttir, Christos Alexopoulos, David Goldsman:
Steady-State Simulation with Replication-Dependent Initial Transients: Analysis and Examples. 177-191
Volume 25, Number 2, Spring 2013
- Aristide Mingozzi, Roberto Roberti
An Exact Algorithm for the Multitrip Vehicle Routing Problem. 193-207 - Dimitris Bertsimas, Dan Andrei Iancu, Dmitriy Katz:
A New Local Search Algorithm for Binary Optimization. 208-221 - Oleksii Mostovyi
On Maximum Speedup Ratio of Restart Algorithm Portfolios. 222-229 - Kuo-Hao Chang
Stochastic Trust-Region Response-Surface Method (STRONG) - A New Response-Surface Framework for Simulation Optimization. 230-243 - Ruslan Sadykov
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. 244-255 - Ivana Ljubic
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. 256-270 - Daniel E. Steffy, Kati Wolter:
Valid Linear Programming Bounds for Exact Mixed-Integer Programming. 271-284 - Young Myoung Ko, Natarajan Gautam:
Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations. 285-301 - Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. 302-316 - Shing Chih Tsai:
Rapid Screening Procedures for Zero-One Optimization via Simulation. 317-331 - Defu Zhang, Lijun Wei
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem. 332-345 - Yuichi Nagata, Shigenobu Kobayashi:
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem. 346-363 - A. Baykal Hafizoglu, Esma Senturk Gel
Expected Tardiness Computations in Multiclass Priority M/M/c Queues. 364-376 - Rasmus Bokrantz, Anders Forsgren:
An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques. 377-393
Volume 25, Number 3, Summer 2013
- David L. Woodruff:
From the Editor. 395
- David L. Kaufman, Andrew J. Schaefer
Robust Modified Policy Iteration. 396-410 - Edmund K. Burke
A Time Predefined Variable Depth Search for Nurse Rostering. 411-419 - Alper Atamtürk, Laurent Flindt Muller, David Pisinger
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds. 420-431 - Huifen Chen, Bruce W. Schmeiser:
I-SMOOTH: Iteratively Smoothing Mean-Constrained and Nonnegative Piecewise-Constant Functions. 432-445 - Edoardo Amaldi, Kanika Dhyani, Alberto Ceselli
Column Generation for the Minimum Hyperplanes Clustering Problem. 446-460 - Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling. 461-474 - Egon Balas, Gérard Cornuéjols, Tamás Kis
Combining Lift-and-Project and Reduce-and-Split. 475-487 - Boris Defourny
Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning. 488-501 - Yung-Ming Li, Yong Tan, Prabuddha De:
Self-Organized Formation and Evolution of Peer-to-Peer Networks. 502-516 - Patricia E. N. Lutu, Andries P. Engelbrecht
Base Model Combination Algorithm for Resolving Tied Predictions for K-Nearest Neighbor OVA Ensemble Models. 517-526 - Susan R. Hunter
Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets. 527-542 - Akhil Kumar, Wen Yao, Chao-Hsien Chu
Flexible Process Compliance with Semantic Constraints Using Mixed-Integer Programming. 543-559 - Alberto Caprara, Fabio Furini
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. 560-571 - Yu Li, Jia Shu, Xi Wang, Naihua Xiu, Dachuan Xu
Approximation Algorithms for Integrated Distribution Network Design Problems. 572-584 - Jinil Han
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees. 585-596
- Matthew J. Saltzman:
Book Reviews. 597-598
Volume 25, Number 4, Fall 2013
- Susan Margulies, Jing Ma, Illya V. Hicks
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. 599-610 - Markus Chimani, Philipp Hungerländer:
Exact Approaches to Multilevel Vertical Orderings. 611-624 - Anna Ye Du, Sanjukta Das, Ram Ramesh:
Efficient Risk Hedging by Dynamic Forward Pricing: A Study in Cloud Computing. 625-642 - Han-Lin Li, Yao-Huei Huang, Shu-Cherng Fang:
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems. 643-653 - Honggang Wang:
Zigzag Search for Continuous Multiobjective Optimization. 654-665 - Ihsan Yanikoglu
Safe Approximations of Ambiguous Chance Constraints Using Historical Data. 666-681 - Oleg V. Shylo, Oleg A. Prokopyev
Stochastic Operating Room Scheduling for High-Volume Specialties Under Block Booking. 682-692 - Matteo Fischetti, Michele Monaci
Backdoor Branching. 693-700 - Miguel A. Lejeune
Construction of Risk-Averse Enhanced Index Funds. 701-719 - Robert Aboolian
An Efficient Approach for Solving Reliable Facility Location Models. 720-729 - John Gunnar Carlsson, Raghuveer Devulapalli:
Dividing a Territory Among Several Facilities. 730-742 - Edmundo de Souza e Silva, Rosa M. M. Leão, Raymond A. Marie:
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach. 743-757 - Walid W. Nasr, Michael R. Taaffe:
Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks. 758-773 - Juan A. Carrasco:
A New General-Purpose Method for the Computation of the Interval Availability Distribution. 774-791 - Patricia E. N. Lutu, Andries P. Engelbrecht
Positive-versus-Negative Classification for Model Aggregation in Predictive Data Mining. 792-807 - Matteo Fischetti, Domenico Salvagnin:
Approximating the Split Closure. 808-819
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: