Zero-one programming using non-binary tree-search
About: This article is published in The Computer Journal. The article was published on 01 Jan 1971. and is currently open access. The article focuses on the topics: Optimal binary search tree & Binary tree.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Algorithms for large scale set covering problems
TL;DR: The method developed in this paper consists of a tree-search procedure based on a combination of decomposition and state space relaxation which is a technique developed for obtaining lower bounds on the dynamic program associated with a combinatorial optimization problem.
Reliability optimization of a system by zero-one programming
K.B. Misra,J. Sharma +1 more
TL;DR: This paper presents a technique of reliability optimization of a series system subject to multiple linear constraints by using zero-one programming, which reduces computer memory and computational time required by this method.
27
Enumerative Methods in Integer Programming
TL;DR: In this article, enumerative methods in integer programming are discussed and a proper utilization of the logical inequalities is the best way for replacing a host of feasibility tests, which are proposed for enumeration.
20
Set covering and set partitioning: a collection of test problems
E El-Darzi,G Mitra +1 more
TL;DR: A range of test problems taken from different contexts of set covering and set partitioning models are collected in order to test and validate implementations of such algorithms.
An optimizing method in system reliability with failure-modes by implicit enumeration algorithm
TL;DR: A new optimal solution of the numerical example in which the objective function to be minimized is smaller than and the system reliability is higher than that of the integer programming method, respectively.