Polyhedral description of the integer single node flow set with constant bounds

DOI10.1007/S10107-005-0657-5MaRDI QIDQ2583130zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Agostinho Agra, Miguel Constantino

Publication date 13 January 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-005-0657-5

zbMATH Keywords

general mixed integer problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Convex hull results for generalizations of the constant capacity single node flow set
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• Valid inequalities for the single arc design problem with set-ups
• A Polyhedral Study of Integer Variable Upper Bounds

Cites work

• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• Description of 2-integer continuous knapsack polyhedra
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Lower bounds in lot-sizing models: A polyhedral study
• On the dimension of projected polyhedra
• Polyhedral description of the integer single node flow set with constant bounds
• Sequence independent lifting in mixed integer programming
• The complementary class of generalized flow cover inequalities
• Using separation algorithms to generate mixed integer model reformulations
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Valid inequalities for mixed 0-1 programs
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(12)

• Valid inequalities for the single arc design problem with set-ups
• Convex hull results for generalizations of the constant capacity single node flow set
• New valid inequalities for the fixed-charge and single-node flow polytopes
• Lifting for mixed integer programs with variable upper bounds
• Facets for the single node fixed-charge network set with a node set-up variable
• Polyhedral description of the integer single node flow set with constant bounds
• Separation, dimension, and facet algorithms for node flow polyhedra
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• The continuous knapsack set
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• Compact formulations as a union of polyhedra

This page was built for publication: Polyhedral description of the integer single node flow set with constant bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583130)