scientific article; zbMATH DE number 1406243

MaRDI QIDQ4939281zbMATH OpenFDO

Authors Alexander Bockmayr, Thomas Kasper

Publication date 23 February 2000

zbMATH Keywords

combinatorial problemsinteger linear programmingnonlinear programming

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• On Integer Programming and the Branch-Width of the Constraint Matrix
• scientific article; zbMATH DE number 2084694
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• A finite branch-and-bound algorithm for linear multiplicative programming
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• An implicit branch-and-bound algorithm for mixed-integer linear programming

Cited in

(3)

• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• scientific article; zbMATH DE number 2159466 (Why is no real title available?)

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