An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
From MaRDI portal
Publication:5106386
DOI10.1287/ijoc.2021.1117OpenAlexW4226051303MaRDI QIDQ5106386
Junsong Yuan, Mark H. Karwan, Marco E. Lübbecke, Zachary Steever, Chase C. Murray
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1117
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Two exact algorithms for the traveling umpire problem
- Mixed integer programming models for job shop scheduling: A computational analysis
- Survey of multi-objective optimization methods for engineering
- The first international nurse rostering competition 2010
- Cutting planes in integer and mixed integer programming
- An effective VNS for the capacitated \(p\)-median problem
- Partitioning procedures for solving mixed-variables programming problems
- A neural network approach to facility layout problems
- A bionomic approach to the capacitated \(p\)-median problem
- Multicommodity network flows: The impact of formulation on decomposition
- An exact algorithm for the partition coloring problem
- The second international nurse rostering competition
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- General network design: a unified view of combined location and network design problems
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Generation techniques for linear programming instances with controllable properties
- Image classification with the Fisher vector: theory and practice
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-cut algorithm for partition coloring
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Decomposition Principle for Linear Programs
- A sufficient condition for a matrix to be totally unimodular
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Matheuristics for the capacitated p‐median problem