On the Complexity of Timetable and Multicommodity Flow Problems
From MaRDI portal
Publication:4132234
Cited in
(only showing first 100 items - show all)- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- A generalized class-teacher model for some timetabling problems
- A tier-based typed programming language characterizing feasible functionals
- The Induced Disjoint Paths Problem
- CASCADING RANDOM WALKS
- Decision lists and related Boolean functions
- A logic approach to the resolution of constraints in timetabling
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
- Generalized p-center problems: Complexity results and approximation algorithms
- On a multiconstrained model for chromatic scheduling
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Compatible 2-factors
- Paired threshold graphs
- An efficiently solvable graph partition problem to which many problems are reducible
- ATM VP-based network design
- Recognition of unipolar and generalised split graphs
- Finding a feasible course schedule using Tabu search
- Maximum renamable Horn sub-CNFs
- Half-integral five-terminus flows
- No-wait scheduling for locks
- An efficient algorithm for the 3-satisfiability problem
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
- The combinatorics of timetabling
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- Network flow and 2-satisfiability
- Integral decomposition in polyhedra
- Restrictions and preassignments in preemptive open shop scheduling
- Online interval scheduling with predictions
- A generalization of interval edge-colorings of graphs
- A minimum cost network flow model for the maximum covering and patrol routing problem
- A rational reconstruction of nonmonotonic truth maintenance systems
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- On the use of graphs in discrete tomography
- Disconnectivity and relative positions in simultaneous embeddings
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
- OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Solving the resolution-free SAT problem by submodel propagation in linear time
- On complexity, representation and approximation of integral multicommodity flows
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Tree metrics and edge-disjoint \(S\)-paths
- On width measures and topological problems on semi-complete digraphs
- Solving partition problems with colour-bipartitions
- A practical map labeling algorithm.
- Modeling elements and solving techniques for the data dissemination problem
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- Online interval scheduling with predictions
- The terminal-pairability problem in complete bipartite graphs
- Minimum-diameter covering problems
- Monte Carlo hyper-heuristics for examination timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
- On the r,s-SAT satisfiability problem and a conjecture of Tovey
- Counting the number of solutions for instances of satisfiability
- On-line 2-satisfiability
- An introduction to timetabling
- Polyhedral combinatorics of multi-index axial transportation problems
- NP-Complete operations research problems and approximation algorithms
- On the complexity of manpower shift scheduling
- Integral biflow maximization
- Connectivity vs. reachability
- On computing minimal models
- Combinatorial optimization in system configuration design
- Edges and switches, tunnels and bridges
- Chromatic optimisation: Limitations, objectives, uses, references
- Rectilinear-upward planarity testing of digraphs
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- Algorithms solving the matching cut problem
- The Rabin index of parity games: its complexity and approximation
- Packing paths in planar graphs
- The Multi-SAT algorithm
- Digraph width measures in parameterized algorithmics
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Mathematical models and algorithms for a high school timetabling problem
- Variable neighborhood search based algorithms for high school timetabling
- Boundary properties of the satisfiability problems
- The commodity-split multi-compartment capacitated arc routing problem
- The maximum beer flow problem
- Two results in negation-free logic
- Graph realization of distance sets
- Almost disjoint paths and separating by forbidden pairs
- Filling crosswords is very hard
- Flow logic
- Flow logic
- Condensing timetables with target date divisible by each instructor's number of class hours
- Trichotomy for integer linear systems based on their sign patterns
- A particular timetable problem: Terminal scheduling
- Finding disjoint paths with related path costs
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- Graph isomorphism restricted by lists
- Level-planar drawings with few slopes
- Jointly stable matchings
- Extensions of coloring models for scheduling purposes
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Open shop scheduling with some additional constraints
- Complexity of a 3-dimensional assignment 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)
