The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
From MaRDI portal
Publication:4083209
DOI10.1007/BF01681352zbMATH Open0321.90036MaRDI QIDQ4083209FDOQ4083209
Authors:
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm
- A Simplified Primal (All-Integer) Integer Programming Algorithm
- A primal (all-integer) integer programming algorithm
- Iteration Skipping in Primal Integer Programming
- A New Foundation for a Simplified Primal Integer Programming Algorithm
- Title not available (Why is that?)
This page was built for publication: The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083209)
