Pages that link to "Item:Q4132234"

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

Displaying 50 items.

• Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
• GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
• Complexity of one packing optimization problem (Q289799) (← links)
• A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
• Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
• A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
• Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
• Upgrading edge-disjoint paths in a ring (Q429680) (← links)
• Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
• A survey of school timetabling research (Q475201) (← links)
• Finding disjoint paths in split graphs (Q493652) (← links)
• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• The interval constrained 3-coloring problem (Q500992) (← links)
• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• Half-integral five-terminus flows (Q581412) (← links)
• The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
• On the planar integer two-flow problem (Q585080) (← links)
• ATM VP-based network design (Q596263) (← links)
• A generalization of interval edge-colorings of graphs (Q602763) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
• Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
• Multiflows in symmetric digraphs (Q713317) (← links)
• Rainbow graph splitting (Q719272) (← links)
• On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
• An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
• Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
• Solving partition problems with colour-bipartitions (Q742575) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Connectivity vs. reachability (Q757048) (← links)
• An introduction to timetabling (Q759645) (← links)
• A simplified NP-complete satisfiability problem (Q790612) (← links)
• Packing paths in planar graphs (Q809091) (← links)
• Integer equal flows (Q833591) (← links)
• School timetabling for quality student and teacher schedules (Q842557) (← links)
• Combining column generation and constraint programming to solve the tail assignment problem (Q846141) (← links)
• Improving paper spread in examination timetables using integer programming (Q849784) (← links)
• Finding disjoint paths with related path costs (Q857785) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• How to collect balls moving in the Euclidean plane (Q860383) (← links)
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
• The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
• Algorithms solving the matching cut problem (Q897900) (← links)
• Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)