Your English writing platform
Discover LudwigExact(3)
Therefore, a number of researchers regarded the burst construction problem as a variant of the bin packing problem.
We present a novel integer linear programming formulation of the problem as a variant of the network design problem.
We have modelled the real problem as a variant of the vehicle routing problem with Time Windows and implemented a number of heuristic algorithms based on the most advanced solution techniques for this problem.
Similar(57)
To this end, this paper defines the school bus routing problem (SBRP) as a variant of the vehicle routing problem in which three simultaneous decisions have to be made: (1) determine the set of stops to visit, (2) determine for each student which stop (s)he should walk to, and (3) determine routes that lie along the chosen stops, so that the total traveled distance is minimized.
In this paper we study a complementary edge covering problem (CECP) as a variant of the total edge covering problem (TECP) which has application in the area of facility location.
If k>1 and G is a clique, the MCC k,0) problem is equivalent to the set multicover problem, also known as the set k-cover problem, a variant of the set cover problem in which every element has to be covered k times.
This setup describes a stochastic allocation problem, which we analyze as a variant of the prescheduled workload problem described in [4].
Thus, the burst construction problem can be regarded as a variant of the bin packing problem, the objective of which is to determine the optimal shape and position of each burst in the bandwidth area for maximizing the overall throughput of all constructed bursts.
The problem could be described as a variant of the multiple travelling salesman problems with load balancing [ 7 ].
The cycle trip planning problem (CTPP) can be formulated as a variant of the arc orienteering problem (AOP), which is a well-known combinatorial optimisation problem.
For our purposes, an alpha (and beta) reliable path finding problem is first formulated as a variant of Chance Constrained Multi-objective Programming (CCMOP) model.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com