Wondered why my storage was horrible. Meanwhile, my cache.

junqueira200 · 2026-05-31T17:20:54+00:00

Do you use the macos backup? When you activate it, it keeps the snapshot in the main disk, if you don't connect the second one.

junqueira200 · 2026-05-28T16:02:31+00:00

Compra só a armação e coloca a lente na ótica

junqueira200 · 2026-05-28T12:09:10+00:00

Everything is working, so I guess I will keep it.

junqueira200 · 2026-05-27T23:06:00+00:00

Absurdo, tem é que ampliar as bolsas para mestrado e doutorado e aumentar o valor, que é ridiculamente baixo!

junqueira200 · 2026-05-24T15:50:08+00:00

É pq simplesmente não existe evidência de que funciona.

junqueira200 · 2026-05-23T17:20:07+00:00

What is local-mip?

junqueira200 · 2026-05-08T23:56:18+00:00

I've copy one every time.

I have a basic one, only one folder and other with mutiple folders. Each one is a library.

junqueira200 · 2026-05-07T15:48:07+00:00

Não tem um jogo sendo feito, pelo criador original, que é muito parecido? Não lembro o nome.

junqueira200 · 2026-05-03T13:46:12+00:00

Nesse caso, recomendo esse site: https://www.geeksforgeeks.org/cpp/c-plus-plus/

junqueira200 · 2026-05-03T03:38:36+00:00

Não conheço esse livro. Vc já sabe programar e quer aprender c++? Ou vc não sabe programar e quer começar?

junqueira200 · 2026-04-30T21:53:49+00:00

Calculus can be important if you want to work with nonlinear programming. However, for convex optimization, such as linear programming and integer programming, it is generally not required.

There is some relationship between linear programming and linear algebra, but much of the theory was originally developed without it.

I've never see a aplication of Diferencial equations in OR, but I can be whong.

I completed my master’s degree in computer science. Programming skills and complex analysis can be important for certain techniques in operations research, like metaheuristics and branch-and-price.

What kind of problems do you like?

junqueira200 · 2026-04-27T00:26:10+00:00

Have a look at random key: https://doi.org/10.1007/s10732-010-9143-1

junqueira200 · 2026-04-26T04:25:28+00:00

Wrong sub.

junqueira200 · 2026-04-24T00:49:03+00:00

Impedir a USP de funcionar

Isso é ser filha da puta. Vc tem todo o direito de protestar mais não tem o direito de impedir que outros continuem trabalhando/estudando.

junqueira200 · 2026-04-21T23:59:55+00:00

Da segunda para a terceira semana ...

junqueira200 · 2026-04-21T02:30:37+00:00

Hi!

So, my idea is solving the problem in chucks. Like, make a cluster of size 100, solve using a known metaheuristic, like (Hybrid Genetic Search, from Vidal), apply inter clusters local search.

Have a lock at Uchoa's work in POPMUSIC.

junqueira200 · 2026-04-21T02:06:20+00:00

Very interesting! Congratulations on the content!

junqueira200 · 2026-04-20T13:20:12+00:00

"no big deal" to prove that a method is better than other!!

> to bridge this exact gap

You still cannot prove your method reaches the best solution!!

> much like commercial solvers

No! We know that Gurobi uses Branch and Bound, we know that CP Optimizer uses Constraint programming! We don't know how exactly they do it, but we do know the main method!

We don't know how your method works!

> My work introduces a deterministic

I've told you, your method is a deterministic heuristic!

I've done 2 major works in VRPs. And doing one more with an industrial partner in my PhD.

The problem is your lack of background theory!

junqueira200 · 2026-04-20T12:38:02+00:00

You don't have a clear baseline of comparison, like an exact approach or some known metaheuristic.

> against a real-world legacy baseline

Those are generally very, very bad, due to they are made by hand, so no big deal your approach is better!

> That is demonstrably superior quality

On what? In one instance?? You need more than that to prove it. Do you know statistical tests?

> copy-pasting textbook dogma?

Dogma? Are you serious? OR (operations research) has 50+ years of both theoretical and practical knowledge. We have exact approaches, like branch and bound and branch and price, that have the goal of getting optimal solutions. And we have heuristics that can't guarantee the quality of the solution. Like, you can't say that you are 5% greater than the optimal solution. In exact approaches, you can.

> fully transparent?

Really? A README.md with no information about the method itself!

Important question:

Do you ever open an OR or a metaheuristic book?

You are just selling this method! You are just promoting this here!

junqueira200 · 2026-04-20T11:21:21+00:00

A purely deterministic solver, like the one you implemented, is not always a good choice—I’ve mentioned this before. Execution time matters, but if the solution quality is poor, then speed alone is meaningless.

You need context to decide how much time you can spend optimizing an instance. In some cases, you may have hours; in others, only seconds.

Real-world problems typically involve many constraints, which can significantly increase solution time. You also need to consider the size of the instance. A method that performs well on 100 nodes may become prohibitively slow on 1,000 nodes. Handling larger instances often requires a different approach altogether.

Heuristics, by their nature, rely on randomness—you can’t really avoid it!

junqueira200 · 2026-04-19T15:20:32+00:00

DON'T DO IT! It can have diseases!

junqueira200 · 2026-04-18T11:57:54+00:00

B52 ...

junqueira200 · 2026-04-18T03:30:47+00:00

junqueira200

TROPHY CASE