50 Years of Integer Programming 1958-2008

DOI10.1007/978-3-540-68279-0zbMath1181.90003OpenAlexW2496185699WikidataQ58002885 ScholiaQ58002885MaRDI QIDQ3639219

No author found.

Publication date: 29 October 2009

Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0

Integer programming (90C10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items

On polynomial kernels for sparse integer linear programs ⋮ A fixed point iterative approach to integer programming and its distributed computation ⋮ Introduction to QUBO ⋮ A Uniform Substitution Calculus for Differential Dynamic Logic ⋮ Linear Integer Arithmetic Revisited ⋮ An integer programming approach to the multimode resource-constrained multiproject scheduling problem ⋮ Error bounds for mixed integer nonlinear optimization problems ⋮ Traces of the XII Aussois Workshop on combinatorial optimization ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ Mixed-Integer Convex Representability ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Manifold relaxations for integer programming ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Knapsack problems: a parameterized point of view ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ Designing service system networks with interruption risks ⋮ A new formulation for the liner shipping network design problem ⋮ Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles ⋮ Enhancements on the hyperplanes arrangements in mixed-integer programming techniques ⋮ Online Mixed-Integer Optimization in Milliseconds ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Allocation in multi-agenda disputes: a set-valued games approach ⋮ Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation ⋮ Trichotomy for integer linear systems based on their sign patterns ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ CAST: A Successful Project in Support of the International Space Station Logistics ⋮ On optimization over the efficient set of a multiple objective linear programming problem ⋮ Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ The split closure of a strictly convex body ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ A geometric way to build strong mixed-integer programming formulations ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ On the decidability of finding a positive ILP-instance in a regular set of ILP-instances ⋮ Binary linear programming solutions and non-approximability for control problems in voting systems ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Fast Cube Tests for LIA Constraint Solving ⋮ A complete and terminating approach to linear integer solving ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Refined cut selection for Benders decomposition: applied to network capacity expansion problems ⋮ Concurrent MDPs with Finite Markovian Policies ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms ⋮ Error bounds for mixed integer linear optimization problems