Local search versus linear programming to detect monotonicity in simplicial branch and bound

Casado L. G. and Gazdag-Tóth Boglárka and Hendrix E. M. T. and Messine F.: Local search versus linear programming to detect monotonicity in simplicial branch and bound.
JOURNAL OF GLOBAL OPTIMIZATION, 91. pp. 311-330. ISSN 0925-5001 (2025)

[thumbnail of s10898-023-01310-y.pdf]
Preview
Text
s10898-023-01310-y.pdf - Published Version

Download (1MB) | Preview
Creators:
Casado L. G.
Gazdag-Tóth Boglárka MTMT
Hendrix E. M. T.
Messine F.
Item Type: Journal Article
Journal or Publication Title: JOURNAL OF GLOBAL OPTIMIZATION
Date: 2025
Volume: 91
Page Range: pp. 311-330
ISSN: 0925-5001
Faculty/Unit: Faculty of Science and Informatics
Institution: University of Szeged (2000-)
Language: English
MTMT rekordazonosító: 34354673
DOI azonosító: https://doi.org/10.1007/s10898-023-01310-y
Date Deposited: 2025. Mar. 28. 08:15
Last Modified: 2025. Mar. 28. 08:15
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/36366
Web of Science® Times Cited: 1 View citing articles in Web of Science®

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year