ON A SEARCH PROBLEM RELATED TO BRANCH-AND-BOUND PROCEDURES.

R. M. Karp; M. Saks; A. Wigderson

doi:10.1109/sfcs.1986.34

ON A SEARCH PROBLEM RELATED TO BRANCH-AND-BOUND PROCEDURES.

R. M. Karp^*
, M. Saks
, A. Wigderson

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

A model is described that captures the essential elements common to all branch-and-bound procedures. Storage limitations in these procedures raise an interesting search problem. Deterministic and probabilistic algorithms for this problem presented. The algorithms imply that branch-and-bound can be performed with very small storage and only slightly superlinear time.

Original language	English
Title of host publication	Annual Symposium on Foundations of Computer Science (Proceedings)
Publisher	IEEE
Pages	19-28
Number of pages	10
ISBN (Print)	0818607408, 9780818607400
DOIs	https://doi.org/10.1109/sfcs.1986.34
State	Published - 1986
Externally published	Yes

Publication series

Name	Annual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)	0272-5428

Access to Document

10.1109/sfcs.1986.34

Cite this

@inproceedings{85051e18cc274dd4ad41abcaa94c2907,

title = "ON A SEARCH PROBLEM RELATED TO BRANCH-AND-BOUND PROCEDURES.",

abstract = "A model is described that captures the essential elements common to all branch-and-bound procedures. Storage limitations in these procedures raise an interesting search problem. Deterministic and probabilistic algorithms for this problem presented. The algorithms imply that branch-and-bound can be performed with very small storage and only slightly superlinear time.",

author = "Karp, \{R. M.\} and M. Saks and A. Wigderson",

year = "1986",

doi = "10.1109/sfcs.1986.34",

language = "אנגלית",

isbn = "0818607408",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "IEEE",

pages = "19--28",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

TY - GEN

T1 - ON A SEARCH PROBLEM RELATED TO BRANCH-AND-BOUND PROCEDURES.

AU - Karp, R. M.

AU - Saks, M.

AU - Wigderson, A.

PY - 1986

Y1 - 1986

N2 - A model is described that captures the essential elements common to all branch-and-bound procedures. Storage limitations in these procedures raise an interesting search problem. Deterministic and probabilistic algorithms for this problem presented. The algorithms imply that branch-and-bound can be performed with very small storage and only slightly superlinear time.

AB - A model is described that captures the essential elements common to all branch-and-bound procedures. Storage limitations in these procedures raise an interesting search problem. Deterministic and probabilistic algorithms for this problem presented. The algorithms imply that branch-and-bound can be performed with very small storage and only slightly superlinear time.

UR - https://www.scopus.com/pages/publications/0022862833

U2 - 10.1109/sfcs.1986.34

DO - 10.1109/sfcs.1986.34

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0022862833

SN - 0818607408

SN - 9780818607400

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 19

EP - 28

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -

ON A SEARCH PROBLEM RELATED TO BRANCH-AND-BOUND PROCEDURES.

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this