Pages that link to "Item:Q4132234"

The following pages link to On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234):

Displaying 50 items.

• A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
• Network flow and 2-satisfiability (Q1317481) (← links)
• A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
• Two results in negation-free logic (Q1324497) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• A tabu search algorithm for computing an operational timetable (Q1331550) (← links)
• Pattern matching in a digitized image (Q1336966) (← links)
• Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
• Single bend wiring on surfaces (Q1348375) (← links)
• On-line 2-satisfiability (Q1356216) (← links)
• Restricted coloring models for timetabling (Q1356739) (← links)
• Preassignment requirements in chromatic scheduling (Q1363744) (← links)
• Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
• On computing minimal models (Q1380414) (← links)
• The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
• The disjoint shortest paths problem (Q1392552) (← links)
• Semantics and complexity of abduction from default theories (Q1402749) (← links)
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
• Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
• Complexity of some special types of timetabling problems (Q1600003) (← links)
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Recognition of unipolar and generalised split graphs (Q1736638) (← links)
• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
• Autark assignments of Horn CNFs (Q1742887) (← links)
• Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
• Modeling elements and solving techniques for the data dissemination problem (Q1752253) (← links)
• Integer programming techniques for educational timetabling (Q1754009) (← links)
• Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
• Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
• Scheduling in switching networks with set-up delays (Q1774526) (← links)
• Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
• Solving a real constraint satisfaction model for the university course timetabling problem: a case study (Q1793505) (← links)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• Paired threshold graphs (Q1801073) (← links)
• Scheduling sports competitions on multiple venues. (Q1810517) (← links)
• On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964) (← links)
• Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
• Complexity of a 3-dimensional assignment problem (Q1837625) (← links)
• Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
• A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
• Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
• A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
• Approximate constrained bipartite edge coloring (Q1887041) (← links)
• NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
• On the complexity of manpower shift scheduling (Q1906950) (← links)
• Open shop scheduling with some additional constraints (Q1911243) (← links)
• Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)