Integer programming formulation of combinatorial optimization problems

DOI10.1016/0012-365X(76)90091-1zbMath0357.90042OpenAlexW2013176949MaRDI QIDQ1239086

Toshihide Ibaraki

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(76)90091-1

Mathematics Subject Classification ID

Integer programming (90C10) Permutations, words, matrices (05A05)

Related Items (23)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Representability in mixed integer programming. I: Characterization results ⋮ On the Mixed Binary Representability of Ellipsoidal Regions ⋮ A simplification for some disjunctive formulations ⋮ Fractional 0-1 programming: applications and algorithms ⋮ The number of additional variables required for the integer programming formulation ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Research trends in combinatorial optimization ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ An integer linear programming approach for bilinear integer programming ⋮ Incremental and encoding formulations for mixed integer programming ⋮ Reduction of nonlinear integer separable programming problems^∗ ⋮ Discrete optimization algorithms and problems of decision making in a fuzzy environment ⋮ Algebraic formulation of circuit design problems ⋮ A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Algorithms of discrete optimization and their application to problems with fuzzy coefficients ⋮ Representations of unbounded optimization problems as integer programs ⋮ Ellipsoidal mixed-integer representability ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Integer programming as a framework for optimization and approximability ⋮ Representability of functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• On defining sets of vertices of the hypercube by linear inequalities
• Mixed integer minimization models for piecewise-linear functions of a single variable
• The Quadratic Assignment Problem
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Integer Programming Formulation of Traveling Salesman Problems
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• A Branch-Bound Solution to the General Scheduling Problem
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• The Traveling Salesman Problem: A Survey
• Design of Optimal Switching Networks by Integer Programming
• Canonical Cuts on the Unit Hypercube
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

This page was built for publication: Integer programming formulation of combinatorial optimization problems