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

A Generalized Wedelin Heuristic for Integer Programming

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

DOI10.1287/ijoc.1090.0328zbMath1243.90133OpenAlexW2101066493MaRDI QIDQ2899041

Benjamin Hummel, Oliver Bastert, Sven de Vries

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.0328


zbMATH Keywords

algorithmsheuristicsinteger programming


Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)


Related Items (2)

Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems






This page was built for publication: A Generalized Wedelin Heuristic for Integer Programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2899041&oldid=15858217"
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 19:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki