Alternatives and similar repositories for Self-Guided-ALPs-Discounted-Cost:

Users that are interested in Self-Guided-ALPs-Discounted-Cost are comparing it to the libraries listed below

• cornell-orie / ORSuite
  ☆15Updated last year
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated 10 months ago
• adambehrendt / Crowdsourced-Courier-Scheduling
  ☆11Updated 3 years ago
• TueVJ / PyGuEx
  Examples of optimization problems in Python with Gurobi
  ☆28Updated 9 years ago
• mabolivar / adp-powell-exercises
  Approximate Dynamic Programming exercises from Powell (2011)
  ☆14Updated last year
• GitYiheng / ofcourse
  Order Fulfillment by Multi-Agent Reinforcement Learning
  ☆23Updated last year
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 4 years ago
• PariseC / modeling_examples_using_gurobi_in_python
  how to create models using Gurobi in Python
  ☆15Updated 3 years ago
• davidrey123 / DNDP
  Codes, instances and numerical results for the bilevel discrete network design problem (DNDP).
  ☆15Updated 4 years ago
• goerigk / RO-DNN
  Data and code for the paper Data-Driven Robust Optimization using Unsupervised Deep Learning written by Marc Goerigk and Jannis Kurtz
  ☆23Updated 3 years ago
• d3group / ddop
  Data-Driven operations management - https://d3group.github.io/ddop
  ☆16Updated 10 months ago
• google-deepmind / neural_lns
  ☆46Updated 3 years ago
• mustelideos / optw_rl
  A Reinforcement Learning Approach to the Orienteering Problem with Time Windows
  ☆25Updated 3 years ago
• MarcosChindelar / Bi-Level
  A Variable Neighborhood Descent with Ant Colony Optimization to Solve a Bilevel Problem with Station Location and Vehicles Routing
  ☆20Updated 2 years ago
• yuri-tavares / benders-decomposition
  Implementation of original Benders procedures in Python
  ☆9Updated 6 years ago
• meituan / Meituan-INFORMS-TSL-Research-Challenge
  ☆124Updated 6 months ago
• tumBAIS / euro-meets-neurips-2022
  ☆46Updated 11 months ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆67Updated 3 years ago
• clussificate / SNDHLP
  A branch-and-price-and-cut algorithm for service network design and hub location problem
  ☆17Updated 2 years ago
• JaswanthBadvelu / Reinforcement-Learning-CVRP
  Dynamic Attention Encoder-Decoder model to learn and design heuristics to solve capacitated vehicle routing problems
  ☆44Updated 4 years ago
• RahmanKhorramfar91 / Integer-Benders-for-Stochastic-Programming
  Implementation of Integer bender's cut for SP proposed by Laporte et al.
  ☆10Updated 5 years ago
• khalil-research / Neur2SP
  Neur2SP: Neural Two-Stage Stochastic Programming
  ☆47Updated 2 years ago
• jiawlu / Time_Dependent_VRP_BnP
  ☆12Updated 2 years ago
• ArciAndres / MARL_Battery_Charge
  Multi-Agent Reinforcement Learning approach to solve a battery charge scheduling problem, in a decentralized scenario.
  ☆15Updated 4 years ago
• SudiptaSingh / Q-Learning-based-smart-cab
  Problem Statement A smart city needs smart mobility, and to achieve this objective, the travel should be made convenient through sustain…
  ☆19Updated 6 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• ajitgupta7 / DSVRPTW_PPO
  DRL for Dynamic Stochastic Vehicle Routing Problem with Time Window
  ☆13Updated last year
• amflorio / dvrp-stochastic-requests
  Online algorithms for solving large-scale dynamic vehicle routing problems with stochastic requests
  ☆80Updated 2 years ago
• antoinedesir / RUMnet
  ☆9Updated last year
• colinlee0924 / dqn-agv-dispatching
  ☆12Updated 4 years ago