Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimization parallelizing for discrete programming problems

From MaRDI portal
Publication:1780230
Jump to:navigation, search

DOI10.1023/B:CASA.0000034443.12493.40zbMath1078.90045OpenAlexW2052073070MaRDI QIDQ1780230

V. P. Shilo, V. A. Roshchin, Ivan V. Sergienko

Publication date: 7 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000034443.12493.40


zbMATH Keywords

algorithmdiscrete optimizationcomputing experimentacceleration of the problem solution processRESTART-distribution


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (4)

Problems of discrete optimization: challenges and main approaches to solve them ⋮ On algorithm portfolios and restart strategies ⋮ Restart strategies in optimization: parallel and serial cases ⋮ Restart strategies for GRASP with path-relinking heuristics







This page was built for publication: Optimization parallelizing for discrete programming problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1780230&oldid=14131630"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki