Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
type: Item
instance of: scholarly article
title: Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
zbMATH Open document ID: 0978.90045
DOI: 10.1007/BF02564710
published in: Top
publication date: 2002-02-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1340329
zbMATH Keywords: branch-and-bound
zbMATH Keywords: scheduling
author: Ramon Companys
MaRDI profile type: Publication
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: An adaptive branching rule for the permutation flow-shop problem
cites work: Elimination methods in them ×n sequencing problem
Recommended article: An improved branch and bound algorithm for mixed integer nonlinear programs
Recommended article: Q4240177
Recommended article: Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Recommended article: An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
Recommended article: A branch and bound algorithm for numerical Max-CSP
Recommended article: An improved branch and bound algorithm for the maximum clique problem
Recommended article: A branch and bound algorithm for solving a class of nonlinear integer programming problems
Recommended article: A new branch and bound algorithm for minimax ratios problems
description: scientific article; zbMATH DE number 1340329