Preprocessing composite cutting procedure: an approach to the integer model

DOI10.1080/09720502.2008.10700588zbMATH Open1156.90419OpenAlexW2032582729MaRDI QIDQ3604028FDOQ3604028

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

• An Automatic Method of Solving Discrete Programming Problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tree-search algorithm for mixed integer programming problems
• On the complexity of integer programming
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• Heuristic analysis, linear programming and branch and bound
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)