Improved sorting-based procedure for integer programming
type: Item
instance of: scholarly article
title: Improved sorting-based procedure for integer programming
zbMATH Open document ID: 1002.90037
published in: Mathematical Programming. Series A. Series B
publication date: 2003-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1784739
zbMATH Keywords: multiple subset-sum problem
zbMATH Keywords: complete enumeration
author: Stephan Stoyanov Danchev
MaRDI profile type: Publication
full work available at URL: s101070100245
OpenAlex ID: W1969988418
DOI: 10.1007/S101070100245
Recommended article: An improved partial enumeration algorithm for integer programming problems
Recommended article: An Improved Implicit Enumeration Approach for Integer Programming
Recommended article: Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Recommended article: Q4955976
Recommended article: Improved nonconservative sequential and parallel integer sorting
Recommended article: Improved deterministic parallel integer sorting
Recommended article: A new procedure for solving integer linear programming problems
Recommended article: Improved fast integer sorting in linear space
description: scientific article; zbMATH DE number 1784739