| .. |
|
active_set.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
binary_heap_priority_queue.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
binary_heap_priority_queue.h
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
binary_heap_priority_queue_def.h
|
Fix some spelling errors (mostly in comments).
|
2018-10-20 17:07:41 +02:00 |
|
binary_heap_upair_queue.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
binary_heap_upair_queue.h
|
merge with master branch
|
2017-09-19 09:39:22 -07:00 |
|
binary_heap_upair_queue_def.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
bound_analyzer_on_row.h
|
cleanup mostly, more asserts in tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
bound_propagator.h
|
avoid going creating hnf_cuts if all involved vars have integral values
|
2018-06-27 12:16:58 -07:00 |
|
breakpoint.h
|
merge with master branch
|
2017-09-19 09:39:22 -07:00 |
|
CMakeLists.txt
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
column_info.h
|
changes in column_info of lar_solver
|
2018-09-22 12:01:24 -07:00 |
|
column_namer.h
|
work on order lemma
|
2020-01-28 10:04:21 -08:00 |
|
constraint.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
conversion_helper.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
core_solver_pretty_printer.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
core_solver_pretty_printer.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
core_solver_pretty_printer_def.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
dense_matrix.cpp
|
Move vector.h to old_vector.h and add a shim vector.h
|
2019-02-21 15:38:08 +01:00 |
|
dense_matrix.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
dense_matrix_def.h
|
add var_register
|
2018-06-27 11:39:46 -07:00 |
|
eta_matrix.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
eta_matrix.h
|
replace lean to lp
|
2018-06-27 10:09:23 -07:00 |
|
eta_matrix_def.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
explanation.h
|
var_eqs compiles but broken
|
2020-01-28 10:04:21 -08:00 |
|
factorization.cpp
|
towards full factorizations on a monomial
|
2020-01-28 10:04:21 -08:00 |
|
factorization.h
|
a fix in add_abs_bound() and integrating NB changes
|
2020-01-28 10:04:21 -08:00 |
|
factorization_factory_imp.cpp
|
Refactor basic lemmas out of nla_core
|
2020-01-28 10:04:21 -08:00 |
|
factorization_factory_imp.h
|
call core::random()
|
2020-01-28 10:04:21 -08:00 |
|
general_matrix.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
gomory.cpp
|
change the signature of int_solver::check by adding explanation* parameter
|
2020-01-28 10:04:21 -08:00 |
|
gomory.h
|
change the signature of int_solver::check by adding explanation* parameter
|
2020-01-28 10:04:21 -08:00 |
|
hnf.h
|
fix a bug in lar_solver in queryaing if a column is int
|
2019-08-01 11:51:56 -07:00 |
|
hnf_cutter.h
|
move the indices housekeeping from theory_lra to lar_solver
|
2020-01-28 10:04:21 -08:00 |
|
implied_bound.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
indexed_value.h
|
merge with master branch
|
2017-09-19 09:39:22 -07:00 |
|
indexed_vector.cpp
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
indexed_vector.h
|
work on static_matrix's cells
|
2018-07-29 20:45:13 -07:00 |
|
indexed_vector_def.h
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
indexer_of_constraints.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
int_set.h
|
replace lean to lp
|
2018-06-27 10:09:23 -07:00 |
|
int_solver.cpp
|
cleanup mostly, more asserts in tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
int_solver.h
|
change the signature of int_solver::check by adding explanation* parameter
|
2020-01-28 10:04:21 -08:00 |
|
lar_constraints.h
|
stronger lemmas to avoid branching
|
2020-01-28 10:04:21 -08:00 |
|
lar_core_solver.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lar_core_solver.h
|
small changes
|
2020-01-28 10:04:21 -08:00 |
|
lar_core_solver_def.h
|
add tracing for 2157
|
2019-03-12 20:12:17 -07:00 |
|
lar_solution_signature.h
|
merge with master branch
|
2017-09-19 09:39:22 -07:00 |
|
lar_solver.cpp
|
cleanup mostly, more asserts in tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
lar_solver.h
|
address the NB's comments
|
2020-01-28 10:04:21 -08:00 |
|
lar_term.h
|
tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
lia_move.h
|
a fix in maximize_term
|
2018-07-26 22:46:28 -07:00 |
|
lp_bound_propagator.cpp
|
Fix for module name clash (and thus linking error) in the Visual Studio solution.
|
2018-10-01 12:11:42 +01:00 |
|
lp_core_solver_base.cpp
|
Add missing template instantion for lar_core_solver::m_r_solver
|
2018-10-01 21:35:48 +02:00 |
|
lp_core_solver_base.h
|
track rounded columns in lar_solver
|
2020-01-23 17:21:55 -06:00 |
|
lp_core_solver_base_def.h
|
address the NB's comments
|
2020-01-28 10:04:21 -08:00 |
|
lp_dual_core_solver.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_dual_core_solver.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_dual_core_solver_def.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
lp_dual_simplex.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_dual_simplex.h
|
Remove unnecessary null pointer checks
|
2019-03-22 09:43:34 -07:00 |
|
lp_dual_simplex_def.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_params.pyg
|
rename niil to nla
|
2020-01-28 10:04:21 -08:00 |
|
lp_primal_core_solver.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_primal_core_solver.h
|
cleanup mostly, more asserts in tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
lp_primal_core_solver_def.h
|
snap variables to bounds when maximizing terms
|
2019-03-13 15:28:50 -07:00 |
|
lp_primal_core_solver_tableau_def.h
|
add tracing for 2157
|
2019-03-12 20:12:17 -07:00 |
|
lp_primal_simplex.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_primal_simplex.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
lp_primal_simplex_def.h
|
Remove unnecessary null pointer checks
|
2019-03-22 09:43:34 -07:00 |
|
lp_settings.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_settings.h
|
var_eqs compiles but broken
|
2020-01-28 10:04:21 -08:00 |
|
lp_settings_def.h
|
avoid going creating hnf_cuts if all involved vars have integral values
|
2018-06-27 12:16:58 -07:00 |
|
lp_solver.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_solver.h
|
going over the binary factor for basic lemmas
|
2020-01-28 10:04:21 -08:00 |
|
lp_solver_def.h
|
going over the binary factor for basic lemmas
|
2020-01-28 10:04:21 -08:00 |
|
lp_types.h
|
var_eqs compiles but broken
|
2020-01-28 10:04:21 -08:00 |
|
lp_utils.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
lp_utils.h
|
fixes in the explanations of the tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
lu.cpp
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
lu.h
|
work on static_matrix's cells
|
2018-07-29 20:45:13 -07:00 |
|
lu_def.h
|
work on static_matrix's cells
|
2018-07-29 20:45:13 -07:00 |
|
matrix.cpp
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
matrix.h
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
matrix_def.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
mon_eq.cpp
|
rename
|
2020-01-28 10:04:21 -08:00 |
|
monomial.h
|
var_eqs compiles but broken
|
2020-01-28 10:04:21 -08:00 |
|
mps_reader.h
|
roll back add_var api
|
2020-01-28 10:04:21 -08:00 |
|
nla_basics_lemmas.cpp
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_basics_lemmas.h
|
remove shadow m_core fields
|
2020-01-28 10:04:21 -08:00 |
|
nla_common.cpp
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_common.h
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_core.cpp
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_core.h
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_order_lemmas.cpp
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_order_lemmas.h
|
remove shadow m_core fields
|
2020-01-28 10:04:21 -08:00 |
|
nla_solver.cpp
|
refactor nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_solver.h
|
Add forgotten file
|
2020-01-28 10:04:21 -08:00 |
|
nla_tangent_lemmas.cpp
|
refactoring nla_solver
|
2020-01-28 10:04:21 -08:00 |
|
nla_tangent_lemmas.h
|
remove shadow m_core fields
|
2020-01-28 10:04:21 -08:00 |
|
nra_solver.cpp
|
stronger lemmas to avoid branching
|
2020-01-28 10:04:21 -08:00 |
|
nra_solver.h
|
use explanation.h for conflict explanations everywhere
|
2020-01-28 10:04:21 -08:00 |
|
numeric_pair.h
|
cleanup mostly, more asserts in tangent lemma
|
2020-01-28 10:04:21 -08:00 |
|
permutation_matrix.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
permutation_matrix.h
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
permutation_matrix_def.h
|
avoid going creating hnf_cuts if all involved vars have integral values
|
2018-06-27 12:16:58 -07:00 |
|
polynomial.h
|
follow the smalles branch
|
2018-06-27 11:38:08 -07:00 |
|
random_updater.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
random_updater.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
random_updater_def.h
|
unroll static_matrix to avoid dead cells
|
2018-07-31 22:57:10 -07:00 |
|
rooted_mons.h
|
var_eqs compiles but broken
|
2020-01-28 10:04:21 -08:00 |
|
row_eta_matrix.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
row_eta_matrix.h
|
replace lean to lp
|
2018-06-27 10:09:23 -07:00 |
|
row_eta_matrix_def.h
|
remove warnings in scaler and use m_cut_solver_cycle_on_var
|
2018-06-27 11:37:13 -07:00 |
|
scaler.cpp
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
scaler.h
|
replace lean to lp
|
2018-06-27 10:09:23 -07:00 |
|
scaler_def.h
|
make explicit rational(double)constructor
|
2019-03-19 19:45:33 -07:00 |
|
signature_bound_evidence.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
sparse_vector.h
|
replace lean to lp
|
2018-06-27 10:09:23 -07:00 |
|
square_dense_submatrix.cpp
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
square_dense_submatrix.h
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
square_dense_submatrix_def.h
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
square_sparse_matrix.cpp
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
square_sparse_matrix.h
|
enable printing in Release
|
2018-07-09 20:49:16 -07:00 |
|
square_sparse_matrix_def.h
|
Prefer using empty rather than size comparisons.
|
2018-11-27 21:42:04 +07:00 |
|
stacked_value.h
|
add cancellations
|
2018-06-27 11:35:11 -07:00 |
|
stacked_vector.h
|
python for accessing lambda, switch to theory branching for QF_LRA
|
2019-08-14 15:44:34 -07:00 |
|
static_matrix.cpp
|
unroll static_matrix to avoid dead cells
|
2018-07-31 22:57:10 -07:00 |
|
static_matrix.h
|
Remove superfluous const from returned types
|
2018-10-16 19:30:48 +02:00 |
|
static_matrix_def.h
|
fix the build
|
2018-08-01 08:06:56 -07:00 |
|
tail_matrix.h
|
extract gomory cut functionality in one method
|
2018-06-27 11:39:41 -07:00 |
|
test_bound_analyzer.h
|
avoid going creating hnf_cuts if all involved vars have integral values
|
2018-06-27 12:16:58 -07:00 |
|
ul_pair.h
|
avoid adding constantly false statements to the lemma
|
2020-01-28 10:04:21 -08:00 |
|
var_eqs.cpp
|
Create explanations for octogonal constraints by the var equivalence
|
2020-01-28 10:04:21 -08:00 |
|
var_eqs.h
|
Create explanations for octogonal constraints by the var equivalence
|
2020-01-28 10:04:21 -08:00 |
|
var_register.h
|
move the indices housekeeping from theory_lra to lar_solver
|
2020-01-28 10:04:21 -08:00 |
|
vars_equivalence.h
|
stop keying monomials by abs values
|
2020-01-28 10:04:21 -08:00 |
