The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques

DOI10.1007/BF01681352zbMath0321.90036MaRDI QIDQ4083209

No author found.

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Iteration Skipping in Primal Integer Programming
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• A New Foundation for a Simplified Primal Integer Programming Algorithm
• A primal (all-integer) integer programming algorithm
• Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm

This page was built for publication: The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques