Preprocessing composite cutting procedure: an approach to the integer model

DOI10.1080/09720502.2008.10700588MaRDI QIDQ3604028zbMATH OpenOpenAlexFDO

Authors Elias Munapo

Publication date 24 February 2009

Published in Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720502.2008.10700588

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• A tree-search algorithm for mixed integer programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Heuristic analysis, linear programming and branch and bound
• scientific article; zbMATH DE number 2130220 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• scientific article; zbMATH DE number 42654 (Why is no real title available?)
• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 1021641 (Why is no real title available?)
• On the complexity of integer programming

This page was built for publication: Preprocessing composite cutting procedure: an approach to the integer model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604028)