Showing 1 - 20 of 2,044

1

An Efficient Real-Time Algorithm for Placing Electronic Components on Panel
Huyghe, Catherine ; Negre, Stephane ; Fontaine, Melanie ; et al.
WSEAS Transactions on Information Science and Applications. 21:139-152

bin packing problem heuristic dynamical programming al... pseudo-polynomial algori... lower bound operational research
Journal
Save to List
2

Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule
Kats, Vladimir ; Levner, Eugene
OR Spectrum: Quantitative Approaches in Management. :1-38

Academic journal
Save to List
3

Dyadic linear programming and extensions
Abdi, Ahmad ; Cornuéjols, Gérard ; Guenin, Bertrand ; et al.
Mathematical Programming: A Publication of the Mathematical Optimization Society. 213(1-2):473-516

Academic journal
Save to List
4

Complexity of some arc-partition problems for digraphs
Bang-Jensen, Jørgen ; Bessy, Stéphane ; Gonçalves, Daniel ; et al.
Theoretical Computer Science. 928:167-182

acyclic digraph cycle factor strong subdigraphs branchings polynomial algorithm NP-complete
Journal
Save to List
5

Spanning eulerian subdigraphs in semicomplete digraphs
Bang-Jensen, Jørgen ; Havet, Frédéric ; Yeo, Anders ; et al.
Journal of Graph Theory. 100(2):294-314

polynomial algorithm Semicomplete digraph Tournament Eulerian subdigraph Arc-connectivity [INFO.INFO-DM]Computer S...
Journal
Save to List
6

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
Könen, David ; Stiglmayr, Michael
In Discrete Applied Mathematics 15 December 2025 376:1-14

Academic journal
Save to List
8

Computing remoteness functions of Moore, Wythoff, and Euclid’s games
Boros, Endre ; Gurvich, Vladimir ; Makino, Kazuhisa ; et al.
International Journal of Game Theory. 53(4):1315-1333

Academic journal
Save to List
9

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
Smirnov, A. V.
Automatic Control and Computer Sciences. 58(7):745-752

Academic journal
Save to List
10

Scheduling problems with processing time dependent profit: applications and a nice polynomial case
Fontan, Florian ; Brauner, Nadia ; Lemaire, Pierre ; et al.
PMS 2021 - 17th International Workshop on Project Management and Scheduling, Apr 2021, Toulouse, France

Toulouse, France b-matching polynomial algorithm controllable processing... scheduling [INFO.INFO-RO]Computer S...
Conference
Save to List
11

Equitable colorings of ��-corona products of cubic graphs
Hanna Furmańczyk ; Marek Kubale
Archives of Control Sciences, Vol vol. 34, Iss No 1, Pp 211-223 (2024)

1-absolute approximation... FOS: Computer and inform... 𝑙-corona products Discrete Mathematics (cs... cubic graph equitable chromatic numb...
Academic journal
Save to List
12

Safe sets and in-dominating sets in digraphs
Bai, Yandong ; Bang-Jensen, Jørgen ; Fujita, Shinya ; et al.
Discrete Applied Mathematics. 346:215-227

Safe set Polynomial algorithm 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Tournament
Academic journal
Save to List
13

Algorithms for Competitive Division of Chores
Simina Brânzei ; Fedor Sandomirskiy
Mathematics of Operations Research. 49:398-429

FOS: Computer and inform... General Mathematics Pareto frontier 0102 computer and inform... chores Management Science and O...
Academic journal
Save to List
14

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
J. Bang‐Jensen ; Y. Wang
Journal of Graph Theory. 106:182-197

arc-disjoint subdigraphs in-branchings FOS: Mathematics Mathematics - Combinator... out-branchings polynomial algorithm
Academic journal
Save to List
15

Graph realization of sets of integers
Wawrzyniak, Piotr ; Formanowicz, Piotr
Journal of Mathematical Chemistry. 62(8):1965-1981

Academic journal
Save to List
16

This result is not available to guest users.

17

Lot sizing problem with batch ordering under periodic buyback contract and lost sales
Farhat, Mlouka ; Akbalik, Ayse ; B. Hadj-Alouane, Atidel ; et al.
International Journal of Production Economics. 208:500-511

Lot sizing Buyback contract Batch delivery Piecewise cost Polynomial algorithm Lost sales
Journal
Save to List
18

(1,1)-Cluster Editing is polynomial-time solvable
Gregory Gutin ; Anders Yeo
Discrete Applied Mathematics. 340:259-271

FOS: Computer and inform... Computer Science - Machi... Discrete Mathematics (cs... Cluster editing Polynomial algorithm 0211 other engineering a...
Academic journal
Save to List
19

Deciding multiaffinity of polynomials over a finite field
Selezneva, Svetlana N.
Discrete Mathematics and Applications. 34(4):233-244

Academic journal
Save to List
20

Recent Advances of Disсrete Optimization and Scheduling
Lazarev, Alexander A ; Werner, Frank ; Lin, Bertrand M.T.

scheduling batching ant colony optimization mixed linear integer pro... deterioration rate-modifying activity
eBook
Save to List

Filter