Pages that link to "Item:Q4132234"
From MaRDI portal
The following pages link to On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234):
Displaying 50 items.
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
- The multi-league sports scheduling problem, or how to schedule thousands of matches (Q1984695) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- The complete set of minimal simple graphs that support unsatisfiable 2-CNFs (Q2192070) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- A particular timetable problem: Terminal scheduling (Q2276867) (← links)
- Counting the number of solutions for instances of satisfiability (Q2277848) (← links)
- The undirected two disjoint shortest paths problem (Q2294271) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- On interval \(\Delta\)-coloring of bipartite graphs (Q2356135) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- A polynomial time approximation algorithm for the two-commodity splittable flow problem (Q2392809) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- Simple undirected two-commodity integral flow with a unitary demand (Q2413185) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT (Q2424823) (← links)
- Jointly stable matchings (Q2424832) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- Towards constraint-based school timetabling (Q2468741) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- A practical map labeling algorithm. (Q2482896) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- Disjoint paths in graphs. (Reprint) (Q2497998) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- Bisplit graphs (Q2568470) (← links)
- Reduction from three-dimensional discrete tomography to multicommodity flow problem (Q2581349) (← links)
- Using graphs for some discrete tomography problems (Q2581557) (← links)
- On the complexity of the planar directed edge-disjoint paths problem (Q2583126) (← links)
- Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← links)
- A rational reconstruction of nonmonotonic truth maintenance systems (Q2638808) (← links)
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems (Q2641226) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- The terminal-pairability problem in complete bipartite graphs (Q2659062) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
- Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints (Q2686660) (← links)
