90c27

Documents about 90c27

• Optimal general factor problem and jump system intersection#781295Kyoto University Research Information Repository
• Optimal general factor problem and jump system intersection#781310Kyoto University Research Information Repository
• Multi-tier Flexible Graph Connectivity#788326arXiv (OAI Expanded)
• Multi-tier Flexible Graph Connectivity#792326arXiv (All)
• Bi-objective Two Phase Transportation Problem#926567arXiv (All)
• Optimal Practice Allocation Under Learning Saturation#972562arXiv (All)
• Supplementary Materials to Graph Convolutional Branch and Bound#172189arXiv Biology
• Supplementary Materials to Graph Convolutional Branch and Bound#173205arXiv (OAI)
• Supplementary Materials to Graph Convolutional Branch and Bound#173455arXiv (OAI Expanded)
• Supplementary Materials to Graph Convolutional Branch and Bound#174033arXiv
• Matchings: Source, Goal and Faithful Companion#613939arXiv (OAI Expanded)
• Matchings: Source, Goal and Faithful Companion#614906arXiv (All)
• A new O(n log n) approach for the Euclidean maximum weight matching problem#998419arXiv (All)
• The Combined Van-and-Mopeds Routing Problem with Time Windows: Formulation, Variants, and Solution Methods#668633arXiv (OAI Expanded)
• The Combined Van-and-Mopeds Routing Problem with Time Windows: Formulation, Variants, and Solution Methods#670698arXiv (All)
• Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems#820207arXiv (All)
• An Exact Combinatorial Branch-and-Bound Algorithm for the Job Sequencing and Tool Switching Problem#925577arXiv (All)
• Past-aware game-theoretic centrality: a framework for cardinality-constrained set-function maximization on networks#984926arXiv (All)
• Information-theoretic coordinate subset and partition selection of multivariate Markov chains via submodular optimization#153042arXiv (OAI)
• Flow Games with Public Arcs: the Least Core and the Nucleolus#998274arXiv (All)
• Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#179048arXiv (OAI)
• Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#179246arXiv (OAI Expanded)
• Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#179641arXiv
• Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#180503arXiv Biology
• Cluster deletion and clique partitioning in graphs with bounded clique number#617322arXiv (OAI Expanded)
• Cluster deletion and clique partitioning in graphs with bounded clique number#617822arXiv (All)
• Extending Exact Integrality Gap Computations for the Metric TSP#986210arXiv (All)
• A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game#183166arXiv (OAI)
• A Note on Approximating the Rural Postman Problem below 3/2#779537arXiv (OAI Expanded)
• A Note on Approximating the Rural Postman Problem below 3/2#780912arXiv (All)
• Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games#189316arXiv (OAI)
• Delayed Verification Destabilizes Multi-Agent LLM Belief: Instability Thresholds and Optimal Corrector Placement#1012248arXiv (All)
• Node-Shift-Encoding Genetic Algorithm with fuzzy-enhanced reference tour to solve the bi-objective service-oriented TSP#998800arXiv (All)
• Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#661036arXiv (OAI Expanded)
• Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#662086arXiv (All)