DOI10.1002/net.3230130405zbMath0525.90069OpenAlexW2023521867MaRDI QIDQ3039039
William R. Pulleyblank, Egon Balas
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130405
The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets,
A Polytope for a Product of Real Linear Functions in 0/1 Variables,
On box totally dual integral polyhedra,
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems,
An analytic symmetrization of max flow-min cut,
Global optimization of a quadratic function subject to a bounded mixed integer constraint set,
Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies,
A two-stage decomposition of high school timetabling applied to cases in Denmark,
Generating cutting planes for the semidefinite relaxation of quadratic programs,
Generalized polymatroids and submodular flows,
Extended formulations for the \(A\)-cut problem,
Strong formulations for mixed integer programming: A survey,
Long range planning in the process industries: A projection approach,
The Boolean quadratic polytope: Some characteristics, facets and relatives,
Influence Maximization with Latency Requirements on Social Networks,
Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem,
Toric rings of perfectly matchable subgraph polytopes,
Weighted target set selection on trees and cycles,
PQ-type adjacency polytopes of join graphs,
Material compatibility constraints for make-to-order production planning.,
On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph,
Projecting systems of linear inequalities with binary variables,
Matchings and \(\Delta\)-matroids,
Using separation algorithms to generate mixed integer model reformulations,
\(b\)-matching degree-sequence polyhedra,
An analytical comparison of different formulations of the travelling salesman problem,
On polyhedral projection and parametric programming,
Expressing combinatorial optimization problems by linear programs,
Cutting planes from extended LP formulations,
Coflow polyhedra,
A comparative analysis of several asymmetric traveling salesman problem formulations,
Extended formulations in combinatorial optimization,
Reformulating linear programs with transportation constraints-With applications to workforce scheduling,
The convex hull of two core capacitated network design problems,
A note on hop-constrained walk polytopes.,
Extended formulations in combinatorial optimization,
Perfectly matchable subgraph problem on a bipartite graph,
On the dimension of projected polyhedra,
The perfectly matchable subgraph polytope of an arbitrary graph,
An extended formulation approach to the edge-weighted maximal clique problem,
Projections of the capacitated network loading problem,
Operations that preserve total dual integrality,
The facets of the polyhedral set determined by the Gale-Hoffman inequalities,
The Steiner tree polytope and related polyhedra,
Projection, lifting and extended formulation integer and combinatorial optimization
