Highly Influential

@inproceedings{RangelValdez2013ConstraintMF, title={Constraint models for the bandwidth minimization problem}, author={Nelson Rangel-Valdez and Jos{\'e} Torres-Jim{\'e}nez}, year={2013} }

- Published 2013

The satisfiability problem (SAT) is a well studied problem in logic which searches for a truth assignment of a set of Boolean variables that evaluates a specific formula to true. The bandwidth minimization problem for graphs (BMPG) is a well studied problem in graphs and requires finding the labels of the nodes of a graph such that the maximum absolute… CONTINUE READING

### Presentations referencing similar topics