Joris Kinable's user avatar
Joris Kinable's user avatar
Joris Kinable's user avatar
Joris Kinable
  • Member for 4 years, 9 months
  • Last seen this week
13 votes
Accepted

How to implement a custom global constraint in IBM's ILOG CP optimizer

13 votes
Accepted

Books for integer and mixed integer programming

9 votes

Can we consider the (Famous) "Trolley Problem" as an Optimization Problem?

9 votes
Accepted

Computational complexity to compute an IIS

9 votes

Why is there not a feasible solution for a MIP?

9 votes
Accepted

How to learn Optimization?

9 votes

Is a mathematical programming problem with no objective function an optimization problem?

9 votes

How can I express this max-min in CPLEX?

8 votes

Can a generic ILP solver find graph matchings as fast as a specialized algorithm?

8 votes

Which approaches exist to solve a TSP?

7 votes
Accepted

What insights/info can be gathered from visualizing the Branch & Bound tree

7 votes

Calculate the average of the objective function values ​resulting from metaheuristics after a defined number of executions

7 votes
Accepted

VRP through constraint programming

6 votes

Any good MIP LaTeX template?

6 votes

Convert MPS file to the associated MIP model

6 votes
Accepted

Any transformation of constraints during Cplex's LP problem export?

6 votes
Accepted

A lexicographic objective function

6 votes
Accepted

Graph coloring problem redundant constraints

5 votes

What are best practices for translating of non-monetary goals to € in the objective function?

5 votes

Solving Logic puzzles through optimization

5 votes
Accepted

Use of comparisons in objective function of an ILP

4 votes

Textbook recommendation for linear programming decomposition fundamentals

4 votes

How to determine different gap rates?

4 votes
Accepted

Which constructive heuristics exist for the time-dependent TSP?

4 votes
Accepted

Branch and price with two sets of exponential variables

4 votes

Asymmetric time-constrained capacitated vehicle routing problem

4 votes

Might you know any simple puzzles similar to $n$ queens? Anything parametrized worth running to a constraint solver?

4 votes

Combinatorial Feasibility Cuts for Benders Decomposition

4 votes
Accepted

Adapting a cluster-first-route-second approach for VRP with heterogenous fleet

4 votes

Linear programming, except each "thing you can spend time on" has its own feasible region/requirements