๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of approximate algorithms for the problem of integer programming

โœ Scribed by N.N. Kuzyurin

Publisher
Elsevier Science
Year
1984
Weight
334 KB
Volume
24
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for quadratic
An approximation algorithm for quadratic cost 0โ€“1 mixed integer programming problems
โœ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.

Integer programming models and algorithm
Integer programming models and algorithms for the graph decontamination problem with mobile agents
โœ John Penuel; J. Cole Smith; Siqian Shen ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 371 KB ๐Ÿ‘ 1 views

## Abstract This article considers the problem of using synchronous mobile agents to decontaminate the nodes of a graph given a spreading contamination. We begin by considering the problem of minimizing cleaning time, given initial agent, and contamination locations. Then, we take as input a set of