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.
- The inequality-satisfiability problem (Q935232) (← links)
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints (Q952460) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Polynomial reduction of time-space scheduling to time scheduling (Q1028105) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- Condensing timetables with target date divisible by each instructor's number of class hours (Q1033890) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- The complexity of colouring problems on dense graphs (Q1079363) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation (Q1111776) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344) (← links)
- An interactive system for constructing timetables on a PC (Q1117834) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- The directed subgraph homeomorphism problem (Q1132111) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- An algorithm for imbedding cubic graphs in the torus (Q1140090) (← links)
- Disjoint paths in graphs (Q1150632) (← links)
- 2-linked graphs (Q1150633) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Modelling and solving an acyclic multi-period timetabling problem (Q1186307) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Compatible 2-factors (Q1193724) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- A logic approach to the resolution of constraints in timetabling (Q1194718) (← links)
- On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On the integral plane two-commodity flow problem (Q1197891) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- The logic of constraint satisfaction (Q1204865) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
