Assembly planning by disjunctive programming and geometrical reasoning
From MaRDI portal
Publication:2669707
Recommendations
Cites work
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Disjunctive Programming
- Disjunctive programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
- Generalized Benders decomposition
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- Logic-based Benders decomposition
- Logic-based Benders decomposition for large-scale optimization
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Rapidly-exploring random trees: Progress and prospects
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
Cited in
(4)
This page was built for publication: Assembly planning by disjunctive programming and geometrical reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669707)