On the public citation graph
Boosting Combinatorial Problem Modeling with Machine Learning
0 signed · 72 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-18008-3_6openalex-snapshot
Embedding Decision Trees and Random Forests in Constraint Programming
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_5openalex-snapshot
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
inferredcites →https://doi.org/10.1007/978-3-319-93031-2_18openalex-snapshot
Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_25openalex-snapshot
Active Learning of Combinatorial Features for Interactive Optimization
inferredcites →https://doi.org/10.1016/j.artint.2016.01.005openalex-snapshot
Empirical decision model learning
inferredcites →https://doi.org/10.1016/j.compchemeng.2017.02.010openalex-snapshot
The ALAMO approach to machine learning
inferredcites →https://doi.org/10.1016/j.cor.2019.104781openalex-snapshot
Deep learning assisted heuristic tree search for the container pre-marshalling problem
inferredcites →https://doi.org/10.1016/j.ejor.2015.08.018openalex-snapshot
DASH: Dynamic Approach for Switching Heuristics
inferredcites →https://doi.org/10.1109/ictai.2010.16openalex-snapshot
On Learning Constraint Problems
inferredcites →https://doi.org/10.1142/s0218213007003503openalex-snapshot
BUILDING CONSISTENCIES FOR PARTIALLY DEFINED CONSTRAINTS WITH DECISION TREES AND NEURAL NETWORKS
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.24963/ijcai.2017/104openalex-snapshot
Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming
inferredcites →https://doi.org/10.3389/frobt.2017.00071openalex-snapshot
Constructive Preference Elicitation
inferredcites →https://doi.org/10.48550/arxiv.1703.04529openalex-snapshot
Task-based End-to-end Model Learning in Stochastic Optimization
inferredcites →https://doi.org/10.48550/arxiv.1712.06174openalex-snapshot
Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_3openalex-snapshot
Strong Mixed-Integer Programming Formulations for Trained Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_36openalex-snapshot
Deep Inverse Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_41openalex-snapshot
Embedding Decision Diagrams into Generative Adversarial Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-29908-8_36openalex-snapshot
Mastering Uncertainty: Towards Robust Multistage Optimization with Decision Dependent Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-030-31423-1_7openalex-snapshot
Constraint Learning: An Appetizer
inferred← citeshttps://doi.org/10.1007/978-3-030-37494-5_10openalex-snapshot
Boosting Local Search Using Machine Learning: A Study on Improving Local Search by Graph Classification in Determining Capacity of Shunting Yards
inferred← citeshttps://doi.org/10.1007/978-3-030-46133-1_43openalex-snapshot
Data-Driven Policy on Feasibility Determination for the Train Shunting Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_735-1openalex-snapshot
Optimization with Trained Machine Learning Models Embedded
inferred← citeshttps://doi.org/10.1007/978-3-030-58942-4_27openalex-snapshot
Lossless Compression of Deep Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-64580-9_33openalex-snapshot
Learning Objective Boundaries for Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-77091-4_20openalex-snapshot
Improving the Efficiency of Euclidean TSP Solving in Constraint Programming by Predicting Effective Nocrossing Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-95976-9_14openalex-snapshot
PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs
inferred← citeshttps://doi.org/10.1007/978-981-15-3689-2_1openalex-snapshot
Development of Different Machine Learning Ensemble Classifier for Gully Erosion Susceptibility in Gandheswari Watershed of West Bengal, India
inferred← citeshttps://doi.org/10.1007/s00291-019-00552-1openalex-snapshot
Model formulations for the capacitated lot-sizing problem with service-level constraints
inferred← citeshttps://doi.org/10.1007/s00291-020-00615-8openalex-snapshot
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10107-020-01474-5openalex-snapshot
Strong mixed-integer programming formulations for trained neural networks
inferred← citeshttps://doi.org/10.1007/s10472-020-09722-2openalex-snapshot
Data driven design for online industrial auctions
inferred← citeshttps://doi.org/10.1007/s10472-021-09736-4openalex-snapshot
Classifier-based constraint acquisition
inferred← citeshttps://doi.org/10.1007/s10601-020-09311-4openalex-snapshot
Efficient multiple constraint acquisition
inferred← citeshttps://doi.org/10.1007/s10844-021-00666-5openalex-snapshot
An overview of machine learning techniques in constraint solving
inferred← citeshttps://doi.org/10.1007/s11063-021-10662-zopenalex-snapshot
Application of Supervised Machine Learning Methods on the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1007/s40305-023-00507-yopenalex-snapshot
HiTSP: Towards a Hierarchical Neural Framework for Large-scale Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/s42979-021-00779-2openalex-snapshot
Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104257openalex-snapshot
Integrating symbolic reasoning into neural generative models for design generation
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111138openalex-snapshot
Enhancing column generation by reinforcement learning-based hyper-heuristic for vehicle routing and scheduling problems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2021.107343openalex-snapshot
ENTMOOT: A framework for optimization over ensemble tree models
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105400openalex-snapshot
Reinforcement learning for combinatorial optimization: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.063openalex-snapshot
Machine learning for combinatorial optimization: A methodological tour d’horizon
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.041openalex-snapshot
Optimization with constraint learning: A framework and survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.08.029openalex-snapshot
Artificial intelligence for optimization: Unleashing the potential of parameter generation, model formulation, and solution methods
inferred← citeshttps://doi.org/10.1016/j.energy.2023.127737openalex-snapshot
A data-driven optimization framework for industrial demand-side flexibility
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109199openalex-snapshot
HADA: An automated tool for hardware dimensioning of AI applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115423openalex-snapshot
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
inferred← citeshttps://doi.org/10.1080/21650020.2023.2216768openalex-snapshot
Digital twin applications in urban logistics: an overview
inferred← citeshttps://doi.org/10.1109/access.2020.3004964openalex-snapshot
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
inferred← citeshttps://doi.org/10.1109/access.2021.3131799openalex-snapshot
A Hybrid Reinforcement Learning-Based Model for the Vehicle Routing Problem in Transportation Logistics
inferred← citeshttps://doi.org/10.1109/access.2024.3390042openalex-snapshot
Quantum Reinforcement Learning for Spatio-Temporal Prioritization in Metaverse
inferred← citeshttps://doi.org/10.1109/tpami.2019.2954827openalex-snapshot
Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems
inferred← citeshttps://doi.org/10.1142/s1793830924501088openalex-snapshot
Two-step optimization algorithm operated by heuristic and machine learning methods
inferred← citeshttps://doi.org/10.11606/d.55.2021.tde-19012022-161011openalex-snapshot
Aprendizado de máquina em heurísticas de decomposição para problemas de dimensionamento de lotes
inferred← citeshttps://doi.org/10.1287/ijoc.2020.0993openalex-snapshot
Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
inferred← citeshttps://doi.org/10.1287/ijoc.2021.0225openalex-snapshot
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
inferred← citeshttps://doi.org/10.1287/trsc.2022.0029openalex-snapshot
Machine Learning for Data-Driven Last-Mile Delivery Optimization
inferred← citeshttps://doi.org/10.1609/aaai.v35i9.16939openalex-snapshot
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28655openalex-snapshot
Learning to Learn in Interactive Constraint Acquisition
inferred← citeshttps://doi.org/10.2139/ssrn.4666191openalex-snapshot
Enhancing Column Generation by Reinforcement Learning-Based Hyper-Heuristic for Vehicle Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.23919/acc50511.2021.9482638openalex-snapshot
Regression Optimization for System-level Production Control
inferred← citeshttps://doi.org/10.24963/ijcai.2020/694openalex-snapshot
Learning for Graph Matching and Related Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2023/707openalex-snapshot
AI and Decision Support for Sustainable Socio-Ecosystems
inferred← citeshttps://doi.org/10.3390/math11041028openalex-snapshot
Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.3390/math8112018openalex-snapshot
Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2004.01608openalex-snapshot
Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2007.03203openalex-snapshot
Learning Combined Set Covering and Traveling Salesman Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08182openalex-snapshot
Deep Neural Network Based Ensemble learning Algorithms for the healthcare system (diagnosis of chronic diseases)
inferred← citeshttps://doi.org/10.5220/0007398502850293openalex-snapshot
Determining Capacity of Shunting Yards by Combining Graph Classification with Local Search
inferred← citeshttps://doi.org/10.7717/peerj-cs.3516openalex-snapshot
From recursion to prediction: modeling backtracking effort in TSP with machine learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.