scientific article; zbMATH DE number 2159470

MaRDI QIDQ4667441zbMATH OpenFDO

Authors Kelly K. Easton, G. L. Nemhauser, Michael A. Trick

Publication date 19 April 2005

zbMATH Keywords

column generationimplementationtraveling tournament problemconstraint programming based branch-and-pricesocial golfers problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Recommendations

• Branching in branch-and-price: A generic scheme
• scientific article; zbMATH DE number 2084782
• A note on branch-and-cut-and-price
• Branch-and-Price Guided Search
• A branch-and-price algorithm for a targeting problem
• Branch-and-cut-and-price for capacitated connected facility location
• CP-Based Local Branching
• A branch-and-price algorithm for the capacitated facility location problem
• Branch-and-cut-and-price algorithms for the preemptive RCPSP
• Branch-and-price algorithm for a multicast routing problem

Cited in

(7)

• Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• A survey of search methodologies and automated system development for examination timetabling
• Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
• Constraint Programming
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem

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 Q4667441)