DOI10.1080/03155986.1982.11731876zbMath0501.90069OpenAlexW41039768MaRDI QIDQ3967364
Jean-Claude Picard, Maurice Queyranne
Publication date: 1982
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1982.11731876
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving,
Complexity and Polynomially Solvable Special Cases of QUBO,
Polynomial time algorithm for an optimal stable assignment with multiple partners,
Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem,
A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization, Separation of partition inequalities with terminals, On the efficiency of maximum-flow algorithms on networks with small integer capacities, Maximal closure on a graph with resource constraints, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms, The planar multiterminal cut problem, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, Speedup the optimization of maximal closure of a node-weighted directed acyclic graph, The rotation distance of brooms, Improving graph partitions using submodular functions., The \textsc{max quasi-independent set} problem, Graphic Submodular Function Minimization: A Graphic Approach and Applications, An efficient algorithm for the minimum capacity cut problem, The complexity of controlled selection, A unified approach to finding good stable matchings in the hospitals/residents setting, Using separation algorithms to generate mixed integer model reformulations, Polynomial-time algorithms for submodular Laplacian systems, Fractional covers for forests and matchings, Transitions in geometric minimum spanning trees, Polyhedral results for the precedence-constrained knapsack problem, Structural and algorithmic properties for parametric minimum cuts, Clique-connecting forest and stable set polytopes, Structure of a simple scheduling polyhedron, Extracting maximal information about sets of minimum cuts, Minimizing a submodular function arising from a concave function, Testing membership in matroid polyhedra, Network reinforcement, The poset scheduling problem
