Modified branch-and-bound method for solving a series of problems

zbMATH Open0661.90064MaRDI QIDQ1113803

V. V. Skaletskij

Publication date: 1988

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundseries of discrete optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (2)

A modified version of Tuy's method for solving d.c. programing problem ⋮ About branch and bound method

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Method of sequential modification of the objective function in the assignment problem 👍 👎
• A modification of a method for a class of problems in integer programming 👍 👎
• About branch and bound method 👍 👎
• Branch and bound methods for a search problem 👍 👎
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming 👍 👎

This page was built for publication: Modified branch-and-bound method for solving a series of problems

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