Polaroids: A new tool in non-convex and in integer programming-Reference-Cited by-同舟云学术

Polaroids: A new tool in non-convex and in integer programming

Published:1973-03 Issue:1 Volume:20 Page:13-24
ISSN:0028-1441
Container-title:Naval Research Logistics Quarterly
language:en
Short-container-title:Naval Research Logistics

Author:

Burdet Claude-Alain

Publisher

Wiley

Subject

General Engineering

Reference13 articles.

1. “Intersection Cuts–A New Type of Cutting Planes for Integer Programming.” Operations Research, Vol 19, No. 1, Jan.-Feb. 1971, pp. 19–39.

2. Integer programming and convex analysis: Intersection cuts from outer polars

3. Enumerative inequalities in integer programming

4. “Enumerative Cuts I and II.” To appear, Operations Research (1973).

5. “Simple Polaroids for Non-Convex Quadratic Programming,” Carnegie-Mellon University W. P. 101–71-2 (May, 1972).

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization of linear-convex programs;Optimization;1994-01

2. Deterministic methods in constrained global optimization: Some recent advances and new fields of application;Naval Research Logistics;1990-08

3. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts;Mathematical Programming;1980-12

4. Disjunctive Programming;Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver;1979

5. A cutting plane algorithm for the bilinear programming problem;Naval Research Logistics Quarterly;1977-03