"Code and Data Repository for Approximate Resolution of Stochastic Choice-based Discrete Planning"

LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

This repository provides data for the problem and code for the proposed sampling-based Benders decomposition (SBBD) algorthm and the benchmarking solution approaches. Click to show full abstract

This repository provides data for the problem and code for the proposed sampling-based Benders decomposition (SBBD) algorthm and the benchmarking solution approaches.

Keywords: data repository; approximate resolution; repository; repository approximate; code; code data

Journal Title: INFORMS Journal on Computing
Year Published: 2025

Link to full text (if available)

Share on Social Media: Sign Up to like & get
recommendations!
0

LAUSR

You are not signed in:

Sign Up!

Related content

More Information News Social Media Video Recommended