A Note on Linear Programming and Integer Feasibility
From MaRDI portal
Publication:5560095
Cited in
(5)- Calculating uncertainty intervals in approximate equation systems
- Solving zero-one mixed integer programming problems using tabu search
- Scatter search and star-paths: Beyond the genetic metaphor
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A fundamental problem in linear inequalities with applications to the travelling salesman problem
This page was built for publication: A Note on Linear Programming and Integer Feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560095)