scientific article; zbMATH DE number 1022239

zbMATH Open0870.90096MaRDI QIDQ4339964FDOQ4339964

Authors Alain Guénoche 

Publication date 16 June 1997

Full work available at URL http://www.numdam.org/item?id=MSH_1996__133__57_0

zbMATH Keywords

branch-and-boundcomputation of median ordersweighted tournaments

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• New results on the computation of median orders
• scientific article; zbMATH DE number 878679
• Median linear orders: Heuristics and a branch and bound algorithm
• scientific article; zbMATH DE number 1022238
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments

Cited In (5)

• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Maximum distance between Slater orders and Copeland orders of tournaments
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Median linear orders: Heuristics and a branch and bound algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339964)