Polyhedral techniques in combinatorial optimization I: Theory-Reference-Cited by-同舟云学术

Polyhedral techniques in combinatorial optimization I: Theory

Published:1996-03 Issue:1 Volume:50 Page:3-26
ISSN:0039-0402
Container-title:Statistica Neerlandica
language:en
Short-container-title:Statistica Neerland

Author:

Aardal K.,Hoesel C. P. M.

Publisher

Wiley

Subject

Statistics, Probability and Uncertainty,Statistics and Probability

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1467-9574.1996.tb01478.x/fullpdf

Reference59 articles.

1. K. Aardal(1994 ), Capacitated facility location: separation algorithms and computational experience, CentER Discussion Paper 9480, Tilburg (submitted for publication).

2. K. Aardal, A. Hipolito, C. P. M. Hoesel, and B. Jansen(1995 ), A branch-andtut algorithm for the frequency assignment problem, Working Paper, Limburg University, Maastricht.

3. K. Aardal, and C. P. M. Hoesel(1995 ), Uncapacitated facility location: Lifting, separation and computations (in preparation).

4. K. Aardal, M. Labbe, J. Leung, and M. Queyranne(1994 ), On the two-level uncapacitated facility location problem, Center Discussion Paper 9486, Tilburg (submitted for publication).

5. K. Aardal, Y. Pochet, and L. A. Wolsey(1993 ), Capacitated facility location: valid inequalities and facets, CORE Discussion Paper 9323, Louvain-la-Neuve (to appear inMathematics of Operations Research).

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

1. A framework for generalized Benders’ decomposition and its application to multilevel optimization;Mathematical Programming;2022-01-29

2. The Boolean Quadric Polytope;The Quadratic Unconstrained Binary Optimization Problem;2022

3. Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects;Cybernetics and Systems Analysis;2020-05

4. On the 2-Club Polytope of Graphs;Operations Research;2016-12

5. Fast Output-Sensitive Approach for Minimum Convex Hulls Formation;Recent Advances in Computational Optimization;2016