Encoding binary arithmetic operations in integer programming formulations
From MaRDI portal
Publication:2016465
Recommendations
- Parsimonious binary-encoding in integer programming
- Improvement of binary integer programming through employment of the Boolean algebra logic
- Incremental and encoding formulations for mixed integer programming
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Some integer formula encodings and related algorithms
Cites work
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- A branch and bound algorithm for the capacitated vehicle routing problem
- Base-2 expansions for linearizing products of functions of discrete variables
- Fundamentals of computer organization and design
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Introduction to modern number theory. Fundamental problems, ideas and theories. Transl. from the Russian
- Minimum cost capacity installation for multicommodity network flows
- On the capacitated vehicle routing problem
- PRIMES is in P
- Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
- Production Planning by Mixed Integer Programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
Cited in
(2)
This page was built for publication: Encoding binary arithmetic operations in integer programming formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016465)