On the Complexity of Timetable and Multicommodity Flow Problems
From MaRDI portal
Publication:4132234
Cited in
(only showing first 100 items - show all)- Disjoint paths in symmetric digraphs
- Combinatorial optimization in system configuration design
- Polynomial reduction of time-space scheduling to time scheduling
- Edges and switches, tunnels and bridges
- Condensing timetables with target date divisible by each instructor's number of class hours
- Decomposition, reformulation, and diving in university course timetabling
- Nash equilibria in all-optical networks
- Uniquely solvable quadratic Boolean equations
- The complexity of colouring problems on dense graphs
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- An interactive system for constructing timetables on a PC
- On fractional multicommodity flows and distance functions
- A hierarchy of propositional Horn formuls
- On orientations and shortest paths
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- An algorithm for imbedding cubic graphs in the torus
- Disjoint paths in graphs
- 2-linked graphs
- A switching algorithm for the solution of quadratic Boolean equations
- Chromatic optimisation: Limitations, objectives, uses, references
- Some results concerning the complexity of restricted colorings of graphs
- Modelling and solving an acyclic multi-period timetabling problem
- Finding a feasible course schedule using Tabu search
- A bounded approximation for the minimum cost 2-sat problem
- Compatible 2-factors
- The point-to-point delivery and connection problems: Complexity and algorithms
- A logic approach to the resolution of constraints in timetabling
- On the complexity of scheduling tasks with discrete starting times
- Tight integral duality gap in the Chinese postman problem
- On the integral plane two-commodity flow problem
- An efficient algorithm for the 3-satisfiability problem
- The logic of constraint satisfaction
- A hierarchy of tractable satisfiability problems
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Extensions of coloring models for scheduling purposes
- Generalized p-center problems: Complexity results and approximation algorithms
- The combinatorics of timetabling
- Generalized partitions of graphs
- On a multiconstrained model for chromatic scheduling
- Interval edge coloring of a graph with forbidden colors
- A fast algorithm for maximum integral two-commodity flow in planar graphs
- Network flow and 2-satisfiability
- A linear algorithm for renaming a set of clauses as a Horn set
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Two results in negation-free logic
- The complexity of propositional closed world reasoning and circumscription
- A tabu search algorithm for computing an operational timetable
- Pattern matching in a digitized image
- Recognition of q-Horn formulae in linear time
- Single bend wiring on surfaces
- On-line 2-satisfiability
- Restricted coloring models for timetabling
- Preassignment requirements in chromatic scheduling
- Multiflows and disjoint paths of minimum total cost
- On computing minimal models
- The complexity of minimum partial truth assignments and implication in negation-free formulae
- Is intractability of nonmonotonic reasoning a real drawback?
- The disjoint shortest paths problem
- Semantics and complexity of abduction from default theories
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- Monotonizing linear programs with up to two nonzeroes per column
- Complexity of some special types of timetabling problems
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Matheuristics for optimizing the network in German wagonload traffic
- Recognition of unipolar and generalised split graphs
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- Autark assignments of Horn CNFs
- Finding read-once resolution refutations in systems of 2CNF clauses
- Modeling elements and solving techniques for the data dissemination problem
- Integer programming techniques for educational timetabling
- Monte Carlo hyper-heuristics for examination timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
- Scheduling in switching networks with set-up delays
- Solving the resolution-free SAT problem by submodel propagation in linear time
- Solving a real constraint satisfaction model for the university course timetabling problem: a case study
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- Paired threshold graphs
- Scheduling sports competitions on multiple venues.
- On the r,s-SAT satisfiability problem and a conjecture of Tovey
- Interval vertex-coloring of a graph with forbidden colors
- Complexity of a 3-dimensional assignment problem
- Approximating a generalization of MAX 2SAT and MIN 2SAT
- A generalized class-teacher model for some timetabling problems
- Recognition and dualization of disguised bidual Horn functions.
- A perspective on certain polynomial-time solvable classes of satisfiability
- Approximate constrained bipartite edge coloring
- NP-completeness of some edge-disjoint paths problems
- On the complexity of manpower shift scheduling
- Open shop scheduling with some additional constraints
- Restrictions and preassignments in preemptive open shop scheduling
- Maximum renamable Horn sub-CNFs
- The Multi-SAT algorithm
- On complexity, representation and approximation of integral multicommodity flows
- On k-positive satisfiability problem
- The multi-league sports scheduling problem, or how to schedule thousands of matches
- On the performance of scatter search for post-enrolment course timetabling problems
This page was built for publication: On the Complexity of Timetable and Multicommodity Flow Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132234)
