Branch and Price for Chance-Constrained Bin Packing (Q3386782)

From MaRDI portal

Revision as of 18:23, 28 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Branch and Price for Chance-Constrained Bin Packing

scientific article

Language	Label	Description	Also known as
English	Branch and Price for Chance-Constrained Bin Packing	scientific article

Statements

scholarly article

0 references

Branch and Price for Chance-Constrained Bin Packing (English)

0 references

0 references

0 references

Brian T. Denton

0 references

INFORMS Journal on Computing

0 references

publication date

7 January 2021

0 references

zbMATH Keywords

bin packing

0 references

chance constraints

0 references

branch and price

0 references

surgery scheduling

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1287/ijoc.2019.0894

0 references

Scheduling space-sharing for internet advertising

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Operating Room Pooling and Parallel Surgery Processing Under Uncertainty

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

On distributionally robust chance-constrained linear programs

0 references

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

0 references

An Application of Bin-Packing to Multiprocessor Scheduling

0 references

A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

0 references

Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems

0 references

A 13/12 approximation algorithm for bin packing with extendable bins

0 references

Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty

0 references

Exact algorithms for the chance-constrained vehicle routing problem

0 references

A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling

0 references

Data-driven chance constrained stochastic program

0 references

Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones

0 references

Decomposition algorithms for two-stage chance-constrained programs

0 references

A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support

0 references

A Sample Approximation Approach for Optimization with Probabilistic Constraints

0 references

A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

0 references

Sample average approximation method for chance constrained programming: Theory and applications

0 references

0 references

Covering Linear Programming with Violations

0 references

Solving a class of stochastic mixed-integer programs with branch and price

0 references

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

0 references

Chance-Constrained Binary Packing Problems

0 references

On robust optimization of two-stage systems

0 references

On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

0 references

An exact algorithm for IP column generation

0 references

Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1287/IJOC.2019.0894

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3386782

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3386782&oldid=39392628"