Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy
- 28 September 1999
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 39 (6), 984-996
- https://doi.org/10.1021/ci9801419
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Heuristic solution of the multisource Weber problem as a p-median problemOperations Research Letters, 1998
- Variable neighborhood searchComputers & Operations Research, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Fully-Naphthalenoid Hydrocarbons and their Conjugation ModesPolycyclic Aromatic Compounds, 1994
- An optimal method for solving the (generalized) multi-Weber problemEuropean Journal of Operational Research, 1992
- McClelland-type lower bound for total π-electron energyJournal of the Chemical Society, Faraday Transactions, 1990
- A note on solving large p-median problemsEuropean Journal of Operational Research, 1985
- Configuration space analysis of travelling salesman problemsJournal de Physique, 1985
- Bounds for total π-electron energy of polymethinesChemical Physics Letters, 1977
- Properties of the Latent Roots of a Matrix: The Estimation of π-Electron EnergiesThe Journal of Chemical Physics, 1971