• Suche: "polynomial algorithm"

Treffer 41 - 60 von 2.044

41

On properties of multiaffine predicates on a finite set
Selezneva, Svetlana N.
Discrete Mathematics and Applications. 33(4):259-267

Fachzeitschrift
Zu den Favoriten
42

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control
Vitali, Jerome

Hadamard Inequality Polynomial Pivot Bound PN Algorithm Lexicographic Perturbati... Universal Shock Lemma Epoch Law …
Zu den Favoriten
43

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP
Iwamasa, Yuni ; Kobayashi, Yusuke ; Takazawa, Kenjiro ; et al.

Polynomial algorithm C_k-free 2-matching Jump system Boolean edge-CSP
Fachzeitschrift
Zu den Favoriten
44

Packing triangles in low degree graphs and indifference graphs
Manić, Gordana ; Wakabayashi, Yoshiko ; Instituto de Matemática e Estatística (IME) ; et al.
2005 European Conference on Combinatorics. :251-256

Berlin, Germany triangle packing approximation algorithm polynomial algorithm low degree graph indifference graph …
Konferenz
Zu den Favoriten
45

Single-machine scheduling of multiple projects with controllable processing times
Geng, Zhichao ; Yuan, Jinjiang
In European Journal of Operational Research 1 August 2023 308(3):1074-1090

Fachzeitschrift
Zu den Favoriten
46

The Implementation of Eulerian Coverings of a Graph for Solving Routing Problems
Makarovskikh, Tatiana ; South Ural State University (SUSU) ; Alexandre Dolgui ; et al.
IFIP International Conference on Advances in Production Management Systems (APMS). :51-58

Nantes, France Graphs Trajectory planning Polynomial algorithm Transportation control [INFO]Computer Science [...
Konferenz
Zu den Favoriten
47

Popular Matchings in Complete Graphs
Ágnes Cseh ; Telikepalli Kavitha ; Ágnes Cseh and Telikepalli Kavitha
Algorithmica. 83:1493-1523

ddc:004 ddc:510 FOS: Computer and inform... Discrete Mathematics (cs... ddc:330 stable matching …
Fachzeitschrift
Zu den Favoriten
48

A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
Bunn, Kevin A. ; Ventura, José A.
In European Journal of Operational Research 16 May 2023 307(1):116-129

Fachzeitschrift
Zu den Favoriten
49

Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint
Halman, Nir ; Kovalyov, Mikhail Y. ; Quilliot, Alain
4OR: A Quarterly Journal of Operations Research. 21(2):235-246

Fachzeitschrift
Zu den Favoriten
50

On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables
Artur Pessoa ; Daniel de Araujo ; Eduardo Uchoa
Operations Research Letters. 58:107209

polynomial algorithm split delivery vehicle routing edge formulation Operations research, mat...
Fachzeitschrift
Zu den Favoriten
51

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties
Bang-Jensen, J. ; Yeo, A.
In Theoretical Computer Science 9 March 2023 949

Fachzeitschrift
Zu den Favoriten
52

Algorithmic mechanism design for egalitarian and congestion-aware airport slot allocation
Dixit, Aasheesh Kumar ; Shakya, Garima ; Jakhar, Suresh Kumar ; et al.
In Transportation Research Part E January 2023 169

Fachzeitschrift
Zu den Favoriten
53

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
Alexander Valeryevich Smirnov
Моделирование и анализ информационных систем, Vol 30, Iss 1, Pp 6-15 (2023)

multiple graph multiple path shortest path reachability set polynomial algorithm Information technology …
Fachzeitschrift
Zu den Favoriten
54

Good acyclic orientations of 4‐regular 4‐connected graphs
Jørgen Bang‐Jensen ; Matthias Kriesell
Journal of Graph Theory. 100:698-720

edge-disjoint spanning t... acyclic orientations st-ordering in-branching polynomial algorithm 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
55

Understanding Popular Matchings via Stable Matchings
Ágnes Cseh ; Yuri Faenza ; Telikepalli Kavitha ; et al.
SIAM Journal on Discrete Mathematics. 36:188-213

ddc:510 FOS: Computer and inform... Discrete Mathematics (cs... ddc:330 stable matching 05C85, 05C70 …
Fachzeitschrift
Zu den Favoriten
56

New Cases of Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Triodes
Sorochan, S. V.
Journal of Applied and Industrial Mathematics. 17(1):185-198

Fachzeitschrift
Zu den Favoriten
57

Maximizing single attribute diversity in group selection
Kovalev, Sergey ; Chalamon, Isabelle ; Petani, Fabio J.
Annals of Operations Research. 320(1):535-540

Fachzeitschrift
Zu den Favoriten
58

Fast Algorithm for Cyber-Attack Estimation and Attack Path Extraction Using Attack Graphs with AND/OR Nodes
Eugene Levner ; Dmitry Tsadikovich
Algorithms ; Volume 17 ; Issue 11 ; Pages: 504

cybersecurity cyber-attack cyclic attack graph attack path AND/OR graph attack time assessment …
Fachzeitschrift
Zu den Favoriten
59

Fair integral submodular flows
Frank, András ; Murota, Kazuo
In Discrete Applied Mathematics 30 October 2022 320:416-434

Fachzeitschrift
Zu den Favoriten
60

Single-machine scheduling with an external resource
Briskorn, Dirk ; Davari, Morteza ; Matuschke, Jannik
European Journal of Operational Research. 293:457-468

FOS: Computer and inform... Technology Operations Research Discrete Mathematics (cs... BOUNDS 0211 other engineering a... …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter