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

Efficient Intelligent Backtracking Using Linear Programming

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

DOI10.1287/ijoc.14.4.373.2823zbMath1238.90144OpenAlexW2064842543MaRDI QIDQ2884543

Bruce Davey, Peter J. Stuckey, Natashia Boland

Publication date: 30 May 2012

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

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

zbMATH Keywords

integer programmingbranch and boundcutting planes


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)


Related Items

Note on the Hahn-Banach theorem in a partially ordered vector space, Experiments with conflict analysis in mixed integer programming, Information-based branching schemes for binary linear mixed integer problems, Computational aspects of infeasibility analysis in mixed integer programming, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming


Uses Software

  • MIPLIB
  • MINTO


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