Dynamic Programming Via Linear Programming

Büyüktahtakın, İ. Esra

doi:10.1002/9780470400531.eorms0277

Cited by 8 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Integer programming and linear programming (LP) are simple and efficient optimization techniques which require the linear objective function and constraints. Linear programs can equivalently formulate dynamic programs [95]. The variables in integer programing are required to be integers and are sometimes constrained to binary.…”

Section: Exact Methodsmentioning

confidence: 99%

Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

et al. 2021

View full text Add to dashboard Cite

Graphs are powerful tools to model manufacturing systems and scheduling problems. The complexity of these systems and their scheduling problems has been substantially increased by the ongoing technological development. Thus, it is essential to generate sustainable graph-based modeling approaches to deal with these excessive complexities. Graphs employ nodes and edges to represent the relationships between jobs, machines, operations, etc. Despite the significant volume of publications applying graphs to shop scheduling problems, the literature lacks a comprehensive survey study. We proposed the first comprehensive review paper which (1) systematically studies the overview and the perspective of this field, (2) highlights the gaps and potential hotspots of the literature, and (3) suggests future research directions towards sustainable graphs modeling the new intelligent/complex systems. We carefully examined 143 peer-reviewed journal papers published from 2015 to 2020. About 70% of our dataset were published in top-ranked journals which confirms the validity of our data and can imply the importance of this field. After discussing our generic data collection methodology, we proposed categorizations over the properties of the scheduling problems and their solutions. Then, we discussed our novel categorization over the variety of graphs modeling scheduling problems. Finally, as the most important contribution, we generated a creative graph-based model from scratch to represent the gaps and hotspots of the literature accompanied with statistical analysis on our dataset. Our analysis showed a significant attention towards job shop systems (56%) and Un/Directed Graphs (52%) where edges can be either directed, or undirected, or both, Whereas 14% of our dataset applied only Undirected Graphs and 11% targeted hybrid systems, e.g., mixed shop, flexible, and cellular manufacturing systems, which shows potential future research directions.

show abstract

Section: Exact Methodsmentioning

confidence: 99%

Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

et al. 2021

View full text Add to dashboard Cite

show abstract

“…It is known that any (discrete) DP can be formulated as an LP, which is integral [31]. (For Stochastic DP, please see, e.g., [30,21,11,20].) However, the technique of producing a tree structure out of a DP table is quite rare.…”

Section: Related Workmentioning

confidence: 99%

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Chalermsook,

Das,

Even

et al. 2018

Preprint

View full text Add to dashboard Cite

In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph G = (V , E) on n vertices, together with a root vertex r and a collection of groupsThe goal is to find a minimum-cost subgraph H that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group S i has a demand k i ∈ [k], k ∈ N, and we wish to find a

show abstract

Approximate Dynamic Programming: Linear Programming-Based Approaches

Barz

Glanzer

2022

Encyclopedia of Optimization

View full text Add to dashboard Cite

Dynamic Programming Via Linear Programming

Cited by 8 publications

References 20 publications

Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

Graph-Based Modeling in Shop Scheduling Problems: Review and Extensions

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Approximate Dynamic Programming: Linear Programming-Based Approaches

Contact Info

Product

Resources

About