Integer Programming
From MaRDI portal
Publication:3191512
DOI10.1007/978-3-319-11008-0zbMath1307.90001OpenAlexW4300568640WikidataQ57568247 ScholiaQ57568247MaRDI QIDQ3191512
Michele Conforti, Cornuéjols, Gérard, Giacomo Zambelli
Publication date: 2 October 2014
Published in: Graduate Texts in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11008-0
Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Multiple cost coefficients sensitivity theorems of integer linear optimization, Popular Branchings and Their Dual Certificates, Maximal Quadratic-Free Sets, On Convex Hulls of Epigraphs of QCQPs, Delta Minors, Delta Free Clutters, and Entanglement, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, Lehman's Theorem and the Directed Steiner Tree Problem, On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming, Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, Conditional Monte Carlo for Reaction Networks, Intersection Disjunctions for Reverse Convex Sets, Quasi-Popular Matchings, Optimality, and Extended Formulations, Mixed-Integer Convex Representability, Multirow Intersection Cuts Based on the Infinity Norm, Influence Maximization with Latency Requirements on Social Networks, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, Decomposition Branching for Mixed Integer Programming, Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs, 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, Branch-and-bound solves random binary IPs in poly\((n)\)-time, Cycle selections, On some lower bounds for the permutation flowshop problem, Heuristics for Finding Sparse Solutions of Linear Inequalities, Matheuristics: survey and synthesis, Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective, Minimum cost flow problem with conflicts, A linear programming based approach to the Steiner tree problem with a fixed number of terminals, Continuity of convex functions at the boundary of their domains: an infinite dimensional Gale-Klee-Rockafellar theorem, Recycling inequalities for robust combinatorial optimization with budget uncertainty, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Towards a characterization of maximal quadratic-free sets, Weighted target set selection on trees and cycles, Research trends in combinatorial optimization, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model, Scalable timing-aware network design via Lagrangian decomposition, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, A survey on mixed-integer programming techniques in bilevel optimization, A theoretical and computational analysis of full strong-branching, An integer linear programming model for tilings, Impact of graph structures for QAOA on maxcut, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, Simple and fast algorithm for binary integer and online linear programming, Achieving consistency with cutting planes, Lower bounds on the size of general branch-and-bound trees, Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, An approximation algorithm for indefinite mixed integer quadratic programming, On the complexity of binary polynomial optimization over acyclic hypergraphs, A polyhedral study of lifted multicuts, Shortest Paths in Graphs of Convex Sets, A new cutting plane method for lexicographic multi-objective integer linear programming, Two-halfspace closure, Computational aspects of relaxation complexity: possibilities and limitations, An exact method for solving the integer sum of linear ratios problem, Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework, Extension Complexity of Independent Set Polytopes, Another pedagogy for pure-integer Gomory, Nonunique Lifting of Integer Variables in Minimal Inequalities, Helly’s theorem: New variations and applications, Polyhedral approaches to learning Bayesian networks, MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*, Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns, Can Cut-Generating Functions Be Good and Efficient?, Split Cuts in the Plane, Approximation of Corner Polyhedra with Families of Intersection Cuts, Optimization Methods: An Applications-Oriented Primer, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines, Lattice Reformulation Cuts, Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization, Mixed Integer Linear Programming Formulation Techniques, On the implementation and strengthening of intersection cuts for QCQPs, A tight approximation algorithm for the cluster vertex deletion problem, Opposite Elements in Clutters, Ideal Clutters That Do Not Pack, Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, CM-types with large index of degeneracy, The RaPID-Ω system: Room and proctor intelligent decider for large scale tests programming, Maximal $S$-Free Convex Sets and the Helly Number, The lower bound of the network connectivity guaranteeing in-phase synchronization, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts, Technical Note—Two-Stage Sample Robust Optimization, Tight bounds on discrete quantitative Helly numbers, An SDP-based approach for computing the stability number of a graph, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, Intersection cuts for single row corner relaxations, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, Circuits and circulant minors, On the tightness of SDP relaxations of QCQPs, Proximity in concave integer quadratic programming, 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, 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, The structure of the infinite models in integer programming, Learning pseudo-backdoors for mixed integer programs, Extension complexities of Cartesian products involving a pyramid, A note on the Lasserre hierarchy for different formulations of the maximum independent set problem, Strong valid inequalities for Boolean logical pattern generation, 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 double oracle approach to minmax regret optimization problems with interval data, 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, An abstract model for branching and its application to mixed integer programming, A note on the 2-circulant inequalities for the MAX-cut problem, Lattice closures of polyhedra, 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, Another pedagogy for mixed-integer Gomory, HYPE: a system of hyperintensional logic (with an application to semantic paradoxes), Facets of a mixed-integer bilinear covering set with bounds on variables, Mixed-integer bilevel representability, Facets from gadgets, 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, Nutmeg: a MIP and CP hybrid solver using branch-and-check, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Cuboids, a class of clutters, On Dantzig figures from graded lexicographic orders, Decomposition methods for the two-stage stochastic Steiner tree problem, Norm ball classifier for one-class classification, Mixed-integer programming approaches for the time-constrained maximal covering routing problem, A branch and cut heuristic for a runway scheduling 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, Public-key cryptosystem based on invariants of diagonalizable groups, Integer programming for urban design, 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, Aggregation-based cutting-planes for packing and covering integer programs, Machine learning for combinatorial optimization: a methodological tour d'horizon, Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution, The (not so) trivial lifting in two dimensions, Primary facets of order polytopes, 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, On approximation algorithms for concave mixed-integer quadratic programming, On the use of intersection cuts for bilevel optimization, Ellipsoidal mixed-integer representability, Extension complexity of the correlation polytope, Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel, Balas formulation for the union of polytopes is optimal, A geometric branch and bound method for robust maximization of convex functions, Granularity in nonlinear mixed-integer optimization, Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops, 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, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Matroid optimization problems with monotone monomials in the objective, Exact and heuristic algorithms for the maximum weighted submatrix coverage problem, ``Facet separation with one linear program, 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, A geometric approach to cut-generating functions, 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
