Cover Image

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ozturk, Berk, Punla-Green, She'ifa, Servi, Les
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Data Structures and Algorithms 90C39
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Implicit Decision Diagrams
by: Rudich, Isaac, et al.
Published: (2026)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
by: Baxi, Saumil, et al.
Published: (2025)

An online joint replenishment problem combined with single machine scheduling
by: Györgyi, Péter, et al.
Published: (2022)

Coach Reservation for Groups Requests
by: Cardonha, Carlos H., et al.
Published: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

Solving the Probabilistic Profitable Tour Problem on a Tree
by: Angelelli, Enrico, et al.
Published: (2022)

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection
by: Coppé, Vianney, et al.
Published: (2022)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Dynamic Programming: From Local Optimality to Global Optimality
by: Stachurski, John, et al.
Published: (2024)

Bayesian Optimal Stopping with Maximum Value Knowledge
by: Kleer, Pieter, et al.
Published: (2025)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

Near-Optimal Sample Complexity for MDPs via Anchoring
by: Lee, Jongmin, et al.
Published: (2025)

Robust Permutation Flowshops Under Budgeted Uncertainty
by: Goldberg, Noam, et al.
Published: (2026)

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
by: Ito, Takehiro, et al.
Published: (2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
by: Chang, Claire, et al.
Published: (2026)

Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)

On Supmodular Matrices
by: Onn, Shmuel
Published: (2023)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
by: Moeini, Mahdi, et al.
Published: (2024)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
by: Gao, Xuan-Zhao, et al.
Published: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

Online Stochastic Packing with General Correlations
by: Cetin, Sabri, et al.
Published: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)

Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)