A Chubanov based algorithm with almost linear complexity for linear programs with very large binary size and few number of vertices. - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

A Chubanov based algorithm with almost linear complexity for linear programs with very large binary size and few number of vertices.

Adrien Chan-Hon-Tong
  • Fonction : Auteur
  • PersonId : 923812
DTIS, ONERA, Université Paris Saclay (COmUE) [Palaiseau]

Résumé

This paper presents an algorithm for linear programming based on Chubanov algorithm for homogeneous linear feasibility. Despite there is little hope that this algorithm is polynomial for generic linear programming, it is theoretically the current best algorithm to solve linear programs with very large binary size but small number of vertices.

Domaines

Recherche opérationnelle [math.OC]
Fichier principal
Vignette du fichier
linearprogram.pdf (300.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Adrien Chan-Hon-Tong  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00722920

Soumis le : lundi 2 septembre 2019-12:09:10

Dernière modification le : vendredi 14 avril 2023-16:46:04

Archivage à long terme le : jeudi 9 janvier 2020-05:55:02

Télécharger pour visualiser

Dates et versions

hal-00722920 , version 1 (06-08-2012)
hal-00722920 , version 2 (04-09-2013)
hal-00722920 , version 3 (04-09-2013)
hal-00722920 , version 4 (11-09-2013)
hal-00722920 , version 5 (01-12-2013)
hal-00722920 , version 6 (26-12-2013)
hal-00722920 , version 7 (20-06-2015)
hal-00722920 , version 8 (12-09-2018)
hal-00722920 , version 9 (17-01-2019)
hal-00722920 , version 10 (07-02-2019)
hal-00722920 , version 11 (15-03-2019)
hal-00722920 , version 12 (25-03-2019)
hal-00722920 , version 13 (12-04-2019)
hal-00722920 , version 14 (28-04-2019)
hal-00722920 , version 15 (12-05-2019)
hal-00722920 , version 16 (05-07-2019)
hal-00722920 , version 17 (23-07-2019)
hal-00722920 , version 18 (16-08-2019)
hal-00722920 , version 19 (02-09-2019)
hal-00722920 , version 20 (07-10-2019)
hal-00722920 , version 21 (19-11-2019)
hal-00722920 , version 22 (20-11-2019)
hal-00722920 , version 23 (20-12-2019)
hal-00722920 , version 24 (11-01-2020)
hal-00722920 , version 25 (20-01-2020)
hal-00722920 , version 26 (02-02-2020)
hal-00722920 , version 27 (11-02-2020)
hal-00722920 , version 28 (26-03-2020)
hal-00722920 , version 29 (17-07-2020)
hal-00722920 , version 30 (05-08-2020)
hal-00722920 , version 31 (12-10-2020)
hal-00722920 , version 32 (14-12-2020)
hal-00722920 , version 33 (02-02-2021)
hal-00722920 , version 34 (03-05-2021)
hal-00722920 , version 35 (07-07-2021)
hal-00722920 , version 36 (19-12-2021)
hal-00722920 , version 37 (17-02-2022)
hal-00722920 , version 38 (16-01-2023)

Identifiants

  • HAL Id : hal-00722920 , version 19

Citer

Adrien Chan-Hon-Tong. A Chubanov based algorithm with almost linear complexity for linear programs with very large binary size and few number of vertices.. 2019. ⟨hal-00722920v19⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite
888 Consultations
1099 Téléchargements

Partager

Gmail Facebook X LinkedIn More