Branch and Cut Methods for Network Optimization

Caccetta

L. Hill

S. P.

Resumen

No disponible

PÁGINAS

pp. 517 - 532

NÚMERO

Volumen: 33 Número: 4-5 Parte: 0 (2001)

MATERIAS

REVISTAS SIMILARES

Artículos similares

Technical Note¿Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

Acceso

Chungmok Lee, Kyungsik Lee, Kyungchul Park, and Sungsoo Park Pág. 604 - 610

Revista: OPERATIONS RESEARCH

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Acceso

Guy Desaulniers Pág. 179 - 192

Revista: OPERATIONS RESEARCH

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

Acceso

Laporte, G. Riera-Ledesma, J. Salazar-Gonzalez, J.-J. Pág. 940 - 951

Revista: OPERATIONS RESEARCH

Special Issue: Discrete Algorithm Engineering - The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Acceso

Jünger, M; Thienel, S Pág. 1325

Revista: SOFTWARE, PRACTICE & EXPERIENCE

Ver todas las revistas