On the Complexity of Timetable and Multicommodity Flow Problems
From MaRDI portal
Publication:4132234
Cited in
(only showing first 100 items - show all)- Bisplit graphs
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Recognition of unipolar and generalised split graphs
- Disjoint paths in graphs. (Reprint)
- Decision lists and related Boolean functions
- 2-linked graphs
- Disjoint paths in graphs
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Recognition of \(q\)-Horn formulae in linear time
- Generalized \(p\)-center problems: Complexity results and approximation algorithms
- Extensions of coloring models for scheduling purposes
- Complexity of a 3-dimensional assignment problem
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- On the use of graphs in discrete tomography
- Integer programming techniques for educational timetabling
- Minimal multicut and maximal integer multiflow: a survey
- On a multiconstrained model for chromatic scheduling
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Algorithms for the maximum satisfiability problem
- On computing minimal models
- The Induced Disjoint Paths Problem
- Network flow and 2-satisfiability
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- GOAL solver: a hybrid local search based solver for high school timetabling
- Minimum-diameter covering problems
- School timetabling for quality student and teacher schedules
- Upgrading edge-disjoint paths in a ring
- The complexity of finding two disjoint paths with min-max objective function
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Using graphs for some discrete tomography problems
- Digraph width measures in parameterized algorithmics
- Finding a feasible course schedule using Tabu search
- Boundary properties of the satisfiability problems
- Half-integral five-terminus flows
- The complexity of colouring problems on dense graphs
- The \(Multi\)-SAT algorithm
- NP-completeness of some edge-disjoint paths problems
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- The complexity of vertex coloring problems in uniform hypergraphs with high degree
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Polynomial reduction of time-space scheduling to time scheduling
- Finding disjoint paths with related path costs
- Bipartite bihypergraphs: a survey and new results
- A tabu search algorithm for computing an operational timetable
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Induced disjoint paths problem in a planar digraph
- Decomposition, reformulation, and diving in university course timetabling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- A bounded approximation for the minimum cost 2-sat problem
- scientific article; zbMATH DE number 2192203 (Why is no real title available?)
- Edge-coloring of 3-uniform hypergraphs
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- A simplified NP-complete satisfiability problem
- A linear algorithm for renaming a set of clauses as a Horn set
- A minimum cost network flow model for the maximum covering and patrol routing problem
- On orientations and shortest paths
- A kernel of order \(2k - c\) for Vertex Cover
- A survey of school timetabling research
- Restricted coloring models for timetabling
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- The directed subgraph homeomorphism problem
- Timetabling problems at the TU Eindhoven
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Combining column generation and constraint programming to solve the tail assignment problem
- Towards constraint-based school timetabling
- Finding two edge-disjoint paths with length constraints
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Multiflows and disjoint paths of minimum total cost
- Mathematical models and algorithms for a high school timetabling problem
- Variable neighborhood search based algorithms for high school timetabling
- A polynomial time solution for labeling a rectilinear map
- An introduction to timetabling
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Complexity of one packing optimization problem
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- The undirected two disjoint shortest paths problem
- A survey of metaheuristic-based techniques for university timetabling problems
- Complexity of some special types of timetabling problems
- The combinatorics of timetabling
- Monte Carlo hyper-heuristics for examination timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
- Classification, models and exact algorithms for multi-compartment delivery problems
- On the complexity of manpower shift scheduling
- Tree metrics and edge-disjoint \(S\)-paths
- Multicommodity network flows: a survey. I: Applications and formulations
- Scheduling in switching networks with set-up delays
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- Uniquely solvable quadratic Boolean equations
- Finding disjoint paths in split graphs
- On complexity, representation and approximation of integral multicommodity flows
- Parameterized complexity analysis for the closest string with wildcards problem
- Maximum renamable Horn sub-CNFs
- On the complexity of scheduling tasks with discrete starting times
- Pattern matching in a digitized image
- On the planar integer two-flow problem
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)
