Peter Mitri ebdbfc0166 update dual status for specific case

2025-01-23 10:41:34 +01:00

..

algorithms

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

base

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

bop

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

constraint_solver

CP/LS improvements

2025-01-14 18:26:25 +01:00

cpp

…

dotnet

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

flatzinc

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

glop

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

glpk

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

graph

more graph cleanup

2025-01-20 14:58:09 +01:00

gscip

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

gurobi

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

init

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

java

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

julia

backport from main

2024-10-01 12:48:20 +02:00

linear_solver

XPRESS LP & QP support in MathOpt

2025-01-20 16:31:57 +01:00

lp_data

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

math_opt

update dual status for specific case

2025-01-23 10:41:34 +01:00

packing

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

pdlp

add comment

2025-01-18 18:43:47 +01:00

port

minor

2025-01-14 15:59:47 +01:00

python

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

routing

fix

2025-01-10 22:44:28 +01:00

sat

[CP-SAT] regroup all hint preservation code in a SolutionCrunch class; more work on no_overlap_2d propagator; add exception processing if an exceptions is raised in a python callback (solution, log, best_bound)

2025-01-20 14:59:53 +01:00

scheduling

Bump copyright to 2025

2025-01-10 11:33:35 +01:00

service/v1

XPRESS LP & QP support in MathOpt

2025-01-20 16:31:57 +01:00

util

minor

2025-01-14 15:59:47 +01:00

xpress

XPRESS LP & QP support in MathOpt

2025-01-20 16:31:57 +01:00