Discrete Optimization: Theory, Algorithms, and Applications (MDPI - Multidisciplinary Digital Publishing Institute, 2024)
Keywords: adjacency energy; adjacency matrix; anti-prism graphs; atom bond connectivity index; average eccentricity; basis; bounded variables; commutative ring; constrained ordered weighted averaging aggregation problem; cut edge; cycle; discharging approach; distance energy; distance matrix; double Roman domination; eccentricity based Zagreb indices; edge version of doubly resolving sets; edge version of metric dimension; extended Petersen graphs; extremal graph; extremal values; fault-tolerant resolving set; first and second Zagreb index; Fractional metric dimension; fully loaded unicyclic graphs; generalized Jahangir graph; generalized Petersen graphs; geometric arithmetic index and oxide network; goal programming; graph; graph transformation; group inverse; Harary graphs; hyper Zagreb index; job-shop; ladder; Laplacian matrix; line graph; Mathematics; Mathematics and Science; metric dimension; mixed integer linear programming; molecular graph; multiple Zagreb indices; multiplicative zagreb indices; n/a; necklace graph; optimality region; Optimization; path; planar graph; resistance distance; Resistance-Harary Index; resolving neighbourhood; resolving set; resolving sets; rooted product; scheduling; scheduling and planning; service system; single-machine scheduling; squared cycle graphs; subdivision graph; tadpole; topological index; total completion time; total completion time objective; total eccentricity; total edge irregularity strength; total irregularity strength; total vertex irregularity strength; uncertain job durations; unicyclic graphs; vertex k-partiteness; wheel; wheel graphs; Zagreb polynomials; zero divisor graphs