default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 36
Volume 36, Number 1, 2024
- Editorial Board. 2-
- Alice E. Smith
:
Note from the Editor. 1-2 - Stefan Bock, Nils Boysen:
Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses. 3-20 - Carla Michini, Peter Ohmann, Ben Liblit, Jeff T. Linderoth:
A Set-Covering Approach to Customized Coverage Instrumentation. 21-38 - Yangming Zhou, Jiaqi Li, Jin-Kao Hao, Fred W. Glover:
Detecting Critical Nodes in Sparse Graphs via "Reduce-Solve-Combine" Memetic Search. 39-60 - Izuwa Ahanor, Hugh R. Medal, Andrew C. Trapp:
DiversiTree: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems. 61-77 - Henri Lefebvre, Enrico Malaguti, Michele Monaci:
Adjustable Robust Optimization with Discrete Uncertainty. 78-96 - Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao:
D-Optimal Data Fusion: Exact and Approximation Algorithms. 97-120 - Yeu-Shiang Huang, Chih-Chiang Fang, Chun-Hsuan Chou, Tzu-Liang (Bill) Tseng:
A Study on Optimal Release Schedule for Multiversion Software. 121-140 - Roberto Baldacci, Stefano Coniglio, Jean-François Cordeau, Fabio Furini:
A Numerically Exact Algorithm for the Bin-Packing Problem. 141-162 - Tianyi Li, Munther A. Dahleh:
Automation of Strategic Data Prioritization in System Model Calibration: Sensor Placement. 163-184 - Yikai Yan, Chaoyue Niu, Yucheng Ding, Zhenzhe Zheng, Shaojie Tang, Qinya Li, Fan Wu, Chengfei Lyu, Yanghe Feng, Guihai Chen:
Federated Optimization Under Intermittent Client Availability. 185-202 - Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. 203-223 - Nicola Bianchessi, Timo Gschwind, Stefan Irnich:
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. 224-244 - Adolfo R. Escobedo:
Exact Matrix Factorization Updates for Nonlinear Programming. 245-265 - Yajuan Li, Zachary T. Kaplan, Marvin K. Nakayama:
Monte Carlo Methods for Economic Capital. 266-284 - Nicolas Forget, Sophie N. Parragh:
Enhancing Branch-and-Bound for Multiobjective 0-1 Programming. 285-304
Volume 36, Number 2, 2024
- Editorial Board. 2-
- Alice E. Smith:
Note from the Editor. 305-307 - Yangming Zhou, Jin-Kao Hao, Zhen Li:
Heuristic Search for Rank Aggregation with Application to Label Ranking. 308-326 - Joaquim Dias Garcia, Guilherme Bodin, Alexandre Street:
BilevelJuMP.jl: Modeling and Solving Bilevel Optimization Problems in Julia. 327-335 - Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra, Shingo Kobori:
Seamless Multimodal Transportation Scheduling. 336-358 - Shaojie Tang, Jing Yuan:
Group Equality in Adaptive Submodular Maximization. 359-376 - Yiyin Cao, Yin Chen, Chuangyin Dang:
A Differentiable Path-Following Method with a Compact Formulation to Compute Proper Equilibria. 377-396 - Richard Krug, Günter Leugering, Alexander Martin, Martin Schmidt, Dieter Weninger:
A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems. 397-416 - Lennart Sinjorgo, Renata Sotirov:
On Solving MAX-SAT Using Sum of Squares. 417-433 - Temitayo Ajayi, Seyedmohammadhossein Hosseinian, Andrew J. Schaefer, Clifton D. Fuller:
Combination Chemotherapy Optimization with Discrete Dosing. 434-455 - Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat, Akshay Sharma:
Flexible Differentiable Optimization via Model Transformations. 456-478 - Markus Leitner, Andrea Lodi, Roberto Roberti, Claudio Sole:
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. 479-494 - Yi Tan, Prakash P. Shenoy, Ben Sherwood, Catherine Shenoy, Melinda Gaddy, Mary E. Oehlert:
Bayesian Network Models for PTSD Screening in Veterans. 495-509 - Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran, Ding-Zhu Du, Zhao Zhang:
Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio. 510-525 - Xiangyi Fan, Grani A. Hanasusanto:
A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse. 526-542 - Defeng Sun, Lixin Tang, Roberto Baldacci, Zihan Chen:
A Decomposition Method for the Group-Based Quay Crane Scheduling Problem. 543-570 - Hao Lin, Guannan Liu, Junjie Wu, J. Leon Zhao:
Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series. 571-586 - Jiajun Xu, Suvrajeet Sen:
Ensemble Variance Reduction Methods for Stochastic Mixed-Integer Programming and their Application to the Stochastic Facility Location Problem. 587-599 - Russell Bent, Byron Tasseff, Carleton Coffrin:
InfrastructureModels: Composable Multi-infrastructure Optimization in Julia. 600-615 - Alireza Aghasi, Arun Rai, Yusen Xia:
A Deep Learning and Image Processing Pipeline for Object Characterization in Firm Operations. 616-634 - Lindong Liu, Xiangtong Qi, Zhou Xu:
Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach. 635-656 - Pietro D'Alessandro, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
The Descent-Ascent Algorithm for DC Programming. 657-671 - Zacharie Alès, Céline Engelbeen, Rosa Figueiredo:
Correlation Clustering Problem Under Mediation. 672-689 - Wei Xu, Jie Tang, Ka Fai Cedric Yiu, Jian-Wen Peng:
An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization. 690-704
Volume 36, Number 3, 2024
- Alice E. Smith:
Note from the Editor. 705-707 - Atefeh Rajabalizadeh, Danial Davarnia:
Solving a Class of Cut-Generating Linear Programs via Machine Learning. 708-722 - Marleen Balvert:
Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets. 723-741 - Jindong Qin, Pan Zheng, Xiaojun Wang:
Product Redesign and Innovation Based on Online Reviews: A Multistage Combined Search Method. 742-765 - Opher Baron, Dmitry Krass, Arik Senderovich, Eliran Sherzer:
Supervised ML for Solving the GI/GI/1 Queue. 766-786 - Mehdi Behroozi:
Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities. 787-819 - Yongzheng Dai, Chen Chen:
Sparsity-Exploiting Distributed Projections onto a Simplex. 820-835 - Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. 836-848 - Shanshan Wang, Erick Delage:
A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems. 849-867 - Jasper van Doornmalen, Christopher Hojny:
Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs. 868-883 - Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard:
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. 884-899 - Benoit Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet:
Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization. 900-917 - Ankit Bansal, Jean-Philippe P. Richard, Bjorn P. Berg, Yu-Li Huang:
A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling. 918-937
Volume 36, Number 4, 2024
- Alice E. Smith:
Note from the Editor. 939-940 - Nicholas D. Kullman, Jorge E. Mendoza, Ted K. Ralphs:
Introduction to the Special Section on Software Tools for Vehicle Routing. 941-942 - Niels A. Wouda, Leon Lan, Wouter Kool:
PyVRP: A High-Performance VRP Solver Package. 943-955 - Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. 956-965 - Patrick S. Klein, Maximilian Schiffer:
RoutingBlocks: An Open-Source Python Package for Vehicle Routing Problems with Intermediate Stops. 966-973 - Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento:
AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem. 974-986 - Hyeonah Kim, Jinkyoo Park, Changhyun Kwon:
A Neural Separation Algorithm for the Rounded Capacity Inequalities. 987-1005 - Fan You, Thomas Vossen:
An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching. 1006-1022 - Eunhye Song, Henry Lam, Russell R. Barton:
A Shrinkage Approach to Improve Direct Bootstrap Resampling Under Input Uncertainty. 1023-1039 - Byron Tasseff, Russell Bent, Carleton Coffrin, Clayton Barrows, Devon Sigler, Jonathan J. Stickel, Ahmed S. Zamzam, Yang Liu, Pascal Van Hentenryck:
Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks. 1040-1063 - Marcos Blufstein, Gonzalo Lera-Romero, Francisco J. Soulignac:
Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone. 1064-1083 - Diego Cattaruzza, Martine Labbé, Matteo Petris, Marius Roland, Martin Schmidt:
Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems. 1084-1107 - Antoine Legrain, Jérémy Omer:
A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price. 1108-1128 - Nagisa Sugishita, Andreas Grothey, Ken McKinnon:
Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment. 1129-1146
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-14 21:08 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:
