scientific article; zbMATH DE number 4008100

zbMATH Open0621.90053MaRDI QIDQ3758561FDOQ3758561

Authors:

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3902395
• scientific article; zbMATH DE number 826948
• scientific article; zbMATH DE number 4064768
• A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
• A branch and bound algorithm for integer separable concave programs

zbMATH Keywords

cutting planelinear constraintsbranch- and-boundconcave quadratic function

Mathematics Subject Classification ID

Quadratic programming (90C20) Integer programming (90C10)

Cited In (13)

• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer quadratic optimization
• Title not available (Why is that?)
• A discrete dynamic convexized method for nonlinear integer programming
• Branch and cut method for solving integer indefinite quadratic bilevel programs
• Une borne optimale pour la programmation entière quasi-convexe
• A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems

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