Branch-and-bound algorithm for the maximum triangle packing problem
- 1 March 2015
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 81, 147-157
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A New Local Search Algorithm for Binary OptimizationINFORMS Journal on Computing, 2013
- On approximating four covering and packing problemsJournal of Computer and System Sciences, 2009
- An improved randomized approximation algorithm for maximum triangle packingDiscrete Applied Mathematics, 2009
- Erratum to “An approximation algorithm for maximum triangle packing”Discrete Applied Mathematics, 2006
- A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test FormsComputational Optimization and Applications, 2006
- An approximation algorithm for maximum triangle packingDiscrete Applied Mathematics, 2006
- The multidimensional 0–1 knapsack problem: An overviewEuropean Journal of Operational Research, 2004
- GRASP for set packing problemsEuropean Journal of Operational Research, 2004
- Packing triangles in bounded degree graphsInformation Processing Letters, 2002
- Set packing relaxations of some integer programsMathematical Programming, 2000