Branch and cut algorithms

Authors:
Abilio Lucena;John E. Beasley
Affiliations:
-;-
Venue:
Advances in linear and integer programming
Year:
1996

Citing 0
Cited 3

Strong lower bounds for the prize collecting Steiner problem in graphs

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
G-PaMeLA: A divide-and-conquer approach for joint channel assignment and routing in multi-radio multi-channel wireless mesh networks

Journal of Parallel and Distributed Computing
Branch and cut methods for network optimization

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract