Pages that link to "Item:Q3039039"

The following pages link to The perfectly matchable subgraph polytope of a bipartite graph (Q3039039):

Displaying 45 items.

• A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• Cutting planes from extended LP formulations (Q507316) (← links)
• Projecting systems of linear inequalities with binary variables (Q646699) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• A note on hop-constrained walk polytopes. (Q703241) (← links)
• The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph (Q911485) (← links)
• Matchings and \(\Delta\)-matroids (Q920097) (← links)
• On polyhedral projection and parametric programming (Q939122) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
• \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
• An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
• Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
• Coflow polyhedra (Q1197009) (← links)
• On the dimension of projected polyhedra (Q1270766) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• The facets of the polyhedral set determined by the Gale-Hoffman inequalities (Q1321672) (← links)
• The Steiner tree polytope and related polyhedra (Q1322552) (← links)
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• An analytic symmetrization of max flow-min cut (Q1356775) (← links)
• Material compatibility constraints for make-to-order production planning. (Q1412704) (← links)
• Projections of the capacitated network loading problem (Q1577107) (← links)
• Operations that preserve total dual integrality (Q1837522) (← links)
• Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
• Long range planning in the process industries: A projection approach (Q1919201) (← links)
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
• A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
• On box totally dual integral polyhedra (Q3717741) (← links)
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
• Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies (Q5066745) (← links)
• Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
• Perfectly matchable subgraph problem on a bipartite graph (Q5189879) (← links)
• Extended formulations in combinatorial optimization (Q5900907) (← links)
• Extended formulations in combinatorial optimization (Q5919994) (← links)
• Toric rings of perfectly matchable subgraph polytopes (Q6081928) (← links)
• Weighted target set selection on trees and cycles (Q6087138) (← links)
• PQ-type adjacency polytopes of join graphs (Q6156092) (← links)