OR-tools
From MaRDI portal
Cited in
(70)- scientific article; zbMATH DE number 7577576 (Why is no real title available?)
- Model-free reinforcement learning for branching Markov decision processes
- View-based propagator derivation
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- MiniCP: a lightweight solver for constraint programming
- Optimizing liner shipping fleet repositioning plans
- Optimal and efficient filtering algorithms for table constraints
- Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant
- Physician scheduling during a pandemic
- OptiLog: a framework for SAT-based systems
- A new approach for vehicle routing with stochastic demand: combining route assignment with process flexibility
- Propagation engine prototyping with a domain specific language
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- A constraint-based local search backend for MiniZinc
- CSPLib
- LKH
- CPlan
- simannf90
- Choco
- FlatZinc
- Gecode
- MiniZinc
- CaSPER
- OscaR
- MINION
- Shrinktech
- Packmol
- Oscar.cbls
- SALBPGen
- STR2
- libexact
- cc(FD)
- ILOG SCHEDULE
- SAFER
- MiniSearch
- CHUFFED
- teaspoon
- QUICKXPLAIN
- ensmallen
- HIBISCUS
- PARPAP
- Mistral
- cspy
- ISUD
- PyTorch Lightning
- VRPy
- CP Optimizer
- NLocalSAT
- Reinforcement learning for combinatorial optimization: a survey
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- scientific article; zbMATH DE number 7453149 (Why is no real title available?)
- CPU Benchmarks
- scientific article; zbMATH DE number 7415109 (Why is no real title available?)
- Model-based algorithm configuration with adaptive capping and prior distributions
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- StableTBN
- RAPOSa
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- A support tool for planning classrooms considering social distancing between students
- Partitioning students into cohorts during COVID-19
- QMKPy
- FairCORELS
- PyPBLib
- Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Auto-tabling for subproblem presolving in MiniZinc
- NeuroLKH
This page was built for software: OR-tools
