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

Synthetic Optimization Problem Generation: Show Us the Correlations!

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

DOI10.1287/ijoc.1090.0330zbMath1243.90132OpenAlexW2145162745MaRDI QIDQ2901078

Charles H. Reilly

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1090.0330


zbMATH Keywords

random variable generationgeneralized assignment0-1 knapsack problem


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Boolean programming (90C09)


Related Items (5)

A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ A decision support tool for generating shipping data for the Hunter Valley coal chain ⋮ Generating new test instances by evolving in instance space ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Measuring instance difficulty for combinatorial optimization problems




This page was built for publication: Synthetic Optimization Problem Generation: Show Us the Correlations!

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