Pages that link to "Item:Q3284268"

The following pages link to An Automatic Method of Solving Discrete Programming Problems (Q3284268):

Displaying 8 items.

• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)
• Multi-period liability clearing via convex optimal control (Q6173805) (← links)
• A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
• Comparison of parallel implementations of the branch-and-bound method for shared memory systems (Q6178124) (← links)
• Exploiting functional constraints in automatic dominance breaking for constraint optimization (Q6488814) (← links)
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)