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

An interval programming algorithm for discrete linear L1 approximation problems

โœ Scribed by P.D Robers; A Ben-Israel

Publisher
Elsevier Science
Year
1969
Tongue
English
Weight
614 KB
Volume
2
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for the discrete bilevel pr
An algorithm for the discrete bilevel programming problem
โœ Jonathan F. Bard; James T. Moore ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

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.