Integer programming formulation of combinatorial optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121283 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- A Branch-Bound Solution to the General Scheduling Problem
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- Canonical Cuts on the Unit Hypercube
- Design of Optimal Switching Networks by Integer Programming
- Integer Programming Formulation of Traveling Salesman Problems
- Mixed integer minimization models for piecewise-linear functions of a single variable
- On defining sets of vertices of the hypercube by linear inequalities
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- 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
- The Traveling Salesman Problem: A Survey
- The decision problem for exponential diophantine equations
- The quadratic assignment problem
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Cited in
(24)- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- On the Mixed Binary Representability of Ellipsoidal Regions
- Representations of unbounded optimization problems as integer programs
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Algebraic formulation of circuit design problems
- Two mixed integer programming formulations arising in manufacturing management
- Representability in mixed integer programming. I: Characterization results
- Fractional 0-1 programming: applications and algorithms
- Discrete optimization algorithms and problems of decision making in a fuzzy environment
- An integer linear programming approach for bilinear integer programming
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- The number of additional variables required for the integer programming formulation
- Representability of functions
- Incremental and encoding formulations for mixed integer programming
- A simplification for some disjunctive formulations
- Mixed integer linear programming formulation techniques
- Reduction of nonlinear integer separable programming problems∗
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Algorithms of discrete optimization and their application to problems with fuzzy coefficients
- Ellipsoidal mixed-integer representability
- Integer programming as a framework for optimization and approximability
- Research trends in combinatorial optimization
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Security analysis of cyber-physical systems using \(\mathcal{H}_2\) norm
This page was built for publication: Integer programming formulation of combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239086)
