Reprint
Discrete Optimization: Theory, Algorithms, and Applications
Edited by
July 2024
246 pages
- ISBN978-3-7258-1628-6 (Hardback)
- ISBN978-3-7258-1627-9 (PDF)
This book is a reprint of the Special Issue Discrete Optimization: Theory, Algorithms, and Applications that was published in
Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary
This Special Issue reprint from Mathematics presents, in addition to the Editorial, 18 research papers in the field of Discrete Optimization. The subjects addressed in this reprint cover a broad spectrum of subjects, e.g., graphs and networks, single- and two-machine scheduling, and goal programming.
Format
- Hardback
License and Copyright
© 2024 by the authors; CC BY-NC-ND license
Keywords
molecular graph; total eccentricity; average eccentricity; eccentricity based Zagreb indices; atom bond connectivity index; geometric arithmetic index and oxide network; hyper Zagreb index; first and second Zagreb index; multiple Zagreb indices; Zagreb polynomials; line graph; subdivision graph; tadpole; wheel; ladder; total edge irregularity strength; total vertex irregularity strength; total irregularity strength; planar graph; constrained ordered weighted averaging aggregation problem; mixed integer linear programming; bounded variables; metric dimension; basis; resolving set; cycle; path; Harary graphs; rooted product; double Roman domination; discharging approach; generalized Petersen graphs; cut edge; graph transformation; multiplicative zagreb indices; extremal values; necklace graph; resolving sets; edge version of metric dimension; edge version of doubly resolving sets; goal programming; scheduling and planning; service system; topological index; vertex k-partiteness; extremal graph; graph; Laplacian matrix; resistance distance; group inverse; topological index; zero divisor graphs; commutative ring; distance matrix; adjacency matrix; distance energy; adjacency energy; wheel graphs; resolving set; fault-tolerant resolving set; extended Petersen graphs; anti-prism graphs; squared cycle graphs; resolving neighbourhood; Fractional metric dimension; generalized Jahangir graph; Resistance-Harary Index; resistance distance; unicyclic graphs; fully loaded unicyclic graphs; scheduling; total completion time; job-shop; single-machine scheduling; uncertain job durations; total completion time objective; optimality region; n/a