Integer Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 549930
- scientific article; zbMATH DE number 3908168
- Integer Programming
- scientific article; zbMATH DE number 1312984
- Computational integer programming
- scientific article; zbMATH DE number 1163810
- scientific article; zbMATH DE number 3968334
- scientific article; zbMATH DE number 1104299
- scientific article; zbMATH DE number 42654
Cited in
(only showing first 100 items - show all)- Submodular maximization and its generalization through an intersection cut lens
- Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
- On a generalization of the Chvátal-Gomory closure
- A theoretical and computational analysis of full strong-branching
- New formulations for two location problems with interconnected facilities
- Optimization methods: an applications-oriented primer
- Piecewise smooth extreme functions are piecewise linear
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- Sequence independent lifting for a set of submodular maximization problems
- A study of data-driven distributionally robust optimization with incomplete joint data under finite support
- On some lower bounds for the permutation flowshop problem
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- Triangulations of flow polytopes, ample framings, and gentle algebras
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Optimality certificates for convex minimization and Helly numbers
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- The k-aggregation closure for covering sets
- Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Exact makespan minimization of unrelated parallel machines
- The (not so) trivial lifting in two dimensions
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- The integrality number of an integer program
- An integer linear programming model for tilings
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Circuits in extended formulations
- Facets from gadgets
- The Hamiltonian p-median problem: polyhedral results and branch-and-cut algorithms
- Distributionally robust scheduling of stochastic knapsack arrivals
- Fiber-to-the-home passive optical distribution network design: a new formulation and valid inequalities using polar duality
- Nonunique lifting of integer variables in minimal inequalities
- ``Facet separation with one linear program
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- A feasible rounding approach for mixed-integer optimization problems
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Last fifty years of integer linear programming: a focus on recent practical advances
- Algorithmic expedients for the S-labeling problem
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Short simplex paths in lattice polytopes
- Idealness of \(k\)-wise intersecting families
- Maximal quadratic-free sets
- Popular branchings and their dual certificates
- On disjunction convex hulls by big-\(\mathrm{M}\) lifting
- scientific article; zbMATH DE number 47668 (Why is no real title available?)
- Impact of graph structures for QAOA on maxcut
- Complexity of scheduling few types of jobs on related and unrelated machines
- Maximal quadratic-free sets
- Lehman's theorem and the directed Steiner tree problem
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- Primal separation and approximation for the \(\{0,1/2\}\)-closure
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Sensitivity analysis for mixed binary quadratic programming
- Maximal S-free convex sets and the Helly number
- A tight approximation algorithm for the cluster vertex deletion problem
- On Dantzig figures from graded lexicographic orders
- On different versions of the exact subgraph hierarchy for the stable set problem
- Integer programming for media streams planning problem
- A tutorial on Branch-Price-and-Cut algorithms
- Extension complexities of Cartesian products involving a pyramid
- Stochastic red-blue set covering: a decomposition approach
- Simple and fast algorithm for binary integer and online linear programming
- Opposite elements in clutters
- Sensitivity analysis for mixed binary quadratic programming
- Outer approximation for integer nonlinear programs via decision diagrams
- Circuits and circulant minors
- Norm ball classifier for one-class classification
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- Integer programming for urban design
- Branch-and-bound solves random binary IPs in poly(n)-time
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A branch-and-bound algorithm for parametric mixed-binary nonlinear programs
- An approximation algorithm for indefinite mixed integer quadratic programming
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Stochastic Lipschitz dynamic programming
- Approximation of corner polyhedra with families of intersection cuts
- Theoretical challenges towards cutting-plane selection
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Logic and integer programming
- On the tightness of SDP relaxations of QCQPs
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
- Expanding students' social networks via optimized team assignments
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
- A characterization of maximal homogeneous-quadratic-free sets
- Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
- Generalised 2-circulant inequalities for the max-cut problem
- Recognizing integrality of weighted rectangles partitions
- Primary facets of order polytopes
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Relaxations and cutting planes for linear programs with complementarity constraints
- Heuristics for Finding Sparse Solutions of Linear Inequalities
This page was built for publication: Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191512)
