<  Back to the Polytechnique Montréal portal

Network flow solution of some non linear 0-1 programming problems and applications to graph theory

Jean-Claude Picard and Maurice Queyranne

Technical Report (1979)

[img] Published Version
Terms of Use: All rights reserved.
Restricted to:
Registered users or access from Polytechnique onlyLog in using your matricule if you are not accessing this document from Polytechnique Montréal's buildings or VPN.

Request a copy
Cite this document: Picard, J.-C. & Queyranne, M. (1979). Network flow solution of some non linear 0-1 programming problems and applications to graph theory (Technical Report n° EP-R-79-14).
Show abstract Hide abstract

Abstract

A0-1 fractional programming problem -- Extensions -- Applications -- Density of a graph -- Pseudo-arboricity and pseudo-forest decomposition of a graph -- The arboricity of a graph -- The maximum clique and vertex packing problems -- Generalisation of the selection problem.

Open Access document in PolyPublie
Department: Département de mathématiques et de génie industriel
Date Deposited: 15 Apr 2021 15:13
Last Modified: 15 Jul 2021 17:01
PolyPublie URL: https://publications.polymtl.ca/5991/
Document issued by the official publisher
Report number: EP-R-79-14

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only