| Commit message (Collapse) | Author | Age |
|
|
|
| |
Quite handy when debugging LPs...
|
|
|
|
| |
Dump a LP solution to a stream for inspection.
|
| |
|
|
|
|
| |
Much faster than the alternatives, so use it when available.
|
|
|
|
|
|
|
|
| |
Using the plain, old C API seems to be *much* faster.
single:
lp_dpcp_bounds::cpu_costs: total=19569.9ms last=93.2767ms average=88.9543ms count=220
lp_dflp_bounds::cpu_costs: total=21537.3ms last=102.459ms average=97.8969ms count=220
|
|
|
|
|
| |
Add a bridge to the GLPK library. Availability is auto-discovered by
the build system. Most of the code is solver-agnostic.
|
|
|
|
|
| |
These files implement the generation and evaluation of linear programs
that bound maximum s-aware pi-blocking under the DPCP and the DFLP.
|
|
|
|
|
|
|
| |
This patch introduces a concrete subclass of Solution that implements the actual
solving of linear programs by means of invoking the CPLEX Concert Technology API.
The project can still be compiled on systems that do not have CPLEX installed.
|
|
- Constraints are expressed as lists of terms.
- Linear programs consist of only equalities and less-than-or-equal constraints.
- Solvers hide behind an abstract solution class that can evaluate
linear expressions.
|