Efficient algorithms for some path partitioning problems (Q1900138): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of one-machine batching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batch sizing and job sequencing on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequence comparison with mixed convex and concave costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138930 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Most uniform path partitioning and its use in image processing / rank | |||
Normal rank | |||
Latest revision as of 17:43, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for some path partitioning problems |
scientific article |
Statements
Efficient algorithms for some path partitioning problems (English)
0 references
22 November 1995
0 references
one-machine batching
0 references
clustering
0 references
image processing
0 references
