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)- Computational integer programming
- Intersection cuts for single row corner relaxations
- Binary extended formulations of polyhedral mixed-integer sets
- Theoretical challenges towards cutting-plane selection
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Strong valid inequalities for Boolean logical pattern generation
- A double oracle approach to minmax regret optimization problems with interval data
- An abstract model for branching and its application to mixed integer programming
- Another pedagogy for mixed-integer Gomory
- 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
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- On Dantzig figures from graded lexicographic orders
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A class of valid inequalities for multilinear 0-1 optimization problems
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- A new lift-and-project operator
- Identification of unidentified equality constraints for integer programming problems
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- Integer programming for urban design
- Aggregation-based cutting-planes for packing and covering integer programs
- On approximation algorithms for concave mixed-integer quadratic programming
- On the use of intersection cuts for bilevel optimization
- Ellipsoidal mixed-integer representability
- Cuboids, a class of clutters
- Algorithmic expedients for the S-labeling problem
- Outer approximation for integer nonlinear programs via decision diagrams
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution
- Linear integer programming. Theory, applications, recent developments
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
- A geometric branch and bound method for robust maximization of convex functions
- A receding horizon event-driven control strategy for intelligent traffic management
- Pitch, extension complexity, and covering problems
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Matroid optimization problems with monotone monomials in the objective
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- Multi-modal supply chain distribution problem
- The aggregation closure is polyhedral for packing and covering integer programs
- Sequence independent lifting for a set of submodular maximization problems
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- A study of data-driven distributionally robust optimization with incomplete joint data under finite support
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Short simplex paths in lattice polytopes
- Stochastic Lipschitz dynamic programming
- Idealness of \(k\)-wise intersecting families
- On a generalization of the Chvátal-Gomory closure
- Maximal quadratic-free sets
- The integrality number of an integer program
- Popular branchings and their dual certificates
- An SDP-based approach for computing the stability number of a graph
- Circuits and circulant minors
- On the tightness of SDP relaxations of QCQPs
- Proximity in concave integer quadratic programming
- A geometric branch-and-bound algorithm for the service bundle design problem
- Total dual dyadicness and dyadic generating sets
- Exact makespan minimization of unrelated parallel machines
- Learning pseudo-backdoors for mixed integer programs
- Lattice closures of polyhedra
- Mixed-integer bilevel representability
- Facets from gadgets
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Norm ball classifier for one-class classification
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Simple majority rule and integer programming
- The (not so) trivial lifting in two dimensions
- Piecewise smooth extreme functions are piecewise linear
- Distances between optimal solutions of mixed-integer programs
- Polyhedral results for position-based scheduling of chains on a single machine
- Extension complexity of the correlation polytope
- Balas formulation for the union of polytopes is optimal
- Granularity in nonlinear mixed-integer optimization
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- ``Facet separation with one linear program
- A geometric approach to cut-generating functions
- Tight bounds on discrete quantitative Helly numbers
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Extension complexities of Cartesian products involving a pyramid
- A note on the 2-circulant inequalities for the MAX-cut problem
- A feasible rounding approach for mixed-integer optimization problems
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- Facets of a mixed-integer bilinear covering set with bounds on variables
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
- An approach to the distributionally robust shortest path problem
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Generalised 2-circulant inequalities for the max-cut problem
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- Derivation and generation of path-based valid inequalities for transmission expansion planning
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)
