Bild från Syndetics
Discrete Optimization: Theory, Algorithms, and Applications
Materialtyp:
ArtikelUtgivningsinformation: MDPI - Multidisciplinary Digital Publishing Institute 2024Innehållstyp: - text
- computer
- online resource
- 9783725816279
- 9783725816286
- Mathematics and Science
- Mathematics
- Optimization
- Fractional metric dimension
- Harary graphs
- Laplacian matrix
- Resistance-Harary Index
- Zagreb polynomials
- 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
- fully loaded unicyclic graphs
- generalized Jahangir graph
- generalized Petersen graphs
- geometric arithmetic index and oxide network
- goal programming
- graph
- graph transformation
- group inverse
- hyper Zagreb index
- job-shop
- ladder
- line graph
- metric dimension
- mixed integer linear programming
- molecular graph
- multiple Zagreb indices
- multiplicative zagreb indices
- necklace graph
- optimality region
- path
- planar graph
- res
Inga fysiska exemplar för denna post
Open Access Unrestricted online access star
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.
Creative Commons Licence cc by-nc-nd cc https://creativecommons.org/licenses/by-nc-nd/4.0/
eng
Freely available e-book