A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
network flow techniquevertex packinginvestment selectionbounding schememaximum-cliqueratio of two polynomialssequence of minimum-cut problemsunconstrained nonlinear 0-1 programming
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Decision theory (91B06) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Nonlinear programming (90C30) Extremal problems in graph theory (05C35) Boolean programming (90C09)
- Simple planar graph partition into three forests
- Feature selection for consistent biclustering via fractional 0-1 programming
- On some algorithmic aspects of hypergraphic matroids
- A linear-time algorithm for finding a minimum spanning pseudoforest
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- A constructive arboricity approximation scheme
- Fractional 0-1 programming: applications and algorithms
- On monoid graphs
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Transforming a graph into a 1-balanced graph
- Forests, frames, and games: Algorithms for matroid sums and applications
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- In search of the densest subgraph
- Gap-Planar Graphs
- Gap-planar graphs
- The equitable dispersion problem
- Coloring the edges of a random graph without a monochromatic giant component
- A Fourth bibliography of fractional programming
- In search of dense subgraphs: How good is greedy peeling?
- The maximum ratio clique problem
- Bounds and algorithms for graph trusses
- Minor-obstructions for apex sub-unicyclic graphs
- Three ways to cover a graph
- Edge-intersection graphs of grid paths: the bend-number
- Decomposing a graph into pseudoforests with one having bounded degree
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- \(w\)-density and \(w\)-balanced property of weighted graphs
- Complexity of maker-breaker games on edge sets of graphs
- Distributed dense subgraph detection and low outdegree orientation
- Second-order properties of undirected graphs
- A parametric maximum flow algorithm for bipartite graphs with applications
- Computing the \(k\) densest subgraphs of a graph
This page was built for publication: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945965)
