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

How effective is aggregation for solving 0-1 models?

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

DOI10.1007/s12597-011-0062-1zbMath1353.90087OpenAlexW1974960506MaRDI QIDQ505111

Archana Khurana, Katta G. Murty

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-011-0062-1


zbMATH Keywords

linear programminginteger programmingaggregation of constraints


Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)


Related Items (1)

Zero duality gap in surrogate constraint optimization: a concise review of models



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Aggregation of constraints in integer programming
  • Aggregation of equations in integer programming
  • A note on aggregating constraints in integer programming
  • Technical Note—Solving Integer Programming Problems by Aggregating Constraints


This page was built for publication: How effective is aggregation for solving 0-1 models?

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