Mixing polyhedra with two non divisible coefficients

DOI10.1007/S10107-011-0448-0zbMATH Open1264.90124OpenAlexW2041296153WikidataQ57736573 ScholiaQ57736573MaRDI QIDQ715089FDOQ715089

Authors: Agostinho Agra, Miguel Constantino 

Publication date: 15 October 2012

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

Full work available at URL: https://doi.org/10.1007/s10107-011-0448-0

Recommendations

• Mixing MIR inequalities with two divisible coefficients
• A compact formulation of a mixed-integer set
• The Mixing Set with Divisible Capacities
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• The Continuous Mixing Polyhedron

zbMATH Keywords

mixed integer programmingfacet defining inequality

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Production Planning by Mixed Integer Programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Mixing mixed-integer inequalities
• Title not available (Why is that?)
• Cutting planes in integer and mixed integer programming
• Network Formulations of Mixed-Integer Programs
• A compact formulation of a mixed-integer set
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• Aggregation and Mixed Integer Rounding to Solve MIPs
• The Mixing Set with Flows
• The mixing set with divisible capacities: a simple approach
• The Mixing Set with Divisible Capacities
• New Hardness Results for Diophantine Approximation
• Compact formulations as a union of polyhedra
• The mixing-MIR set with divisible capacities
• Mixing MIR inequalities with two divisible coefficients

Cited In (10)

• Facets for continuous multi-mixing set with general coefficients and bounded integer variables
• On a class of mixed-integer sets with a single integer variable
• Compact formulations as a union of polyhedra
• Mixing MIR inequalities with two divisible coefficients
• Mixed-integer sets from two rows of two adjacent simplex bases
• A compact formulation of a mixed-integer set
• Finding a fully mixed cell in a mixed subdivision of polytopes
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• On the facets of mixed integer programs with two integer variables and two constraints

This page was built for publication: Mixing polyhedra with two non divisible coefficients

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