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 (only showing first 100 items - show all)
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 ⋮ New formulations for two location problems with interconnected facilities ⋮ 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 ⋮ Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones ⋮ Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization ⋮ Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model ⋮ 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 ⋮ Circuits in extended formulations ⋮ The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms ⋮ Distributionally robust scheduling of stochastic knapsack arrivals ⋮ On different versions of the exact subgraph hierarchy for the stable set problem ⋮ Expanding students' social networks via optimized team assignments ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Total dual dyadicness and dyadic generating sets ⋮ 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
This page was built for publication: Integer Programming
