yusuke1997/dblp-id-title huggingface dataset:
Optimizing over All Combinatorial Embeddings of a Planar Graph
A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
Tight Lower Bounds for Block-Structured Integer Programs
A Unified Algorithm for Degree Bounded Survivable Network Design
Infrastructure Leasing Problems
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems
Probabilistic Analysis of the Generalised Assignment Problem
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems
Improved Approximation Algorithms for Resource Allocation
On Integer Programming and the Branch-Width of the Constraint Matrix
On the L infinity -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
Recognition and Representation of Proper Circular Arc Graphs
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings
Connected Joins in Graphs
Computational Aspects of Relaxation Complexity
Mixed-Integer Cuts from Cyclic Groups
Discrete Newton's Algorithm for Parametric Submodular Function Minimization
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
Pairwise-Independent Contention Resolution
Packing Steiner Forests
Scheduling with Precedence Constraints of Low Fractional Dimension
Centrality of Trees for Capacitated k-Center
Popular Branchings and Their Dual Certificates
On Two-Stage Stochastic Minimum Spanning Trees
A Study of Domino-Parity and k-Parity Constraints for the TSP
Sparsity of Integer Solutions in the Average Case
Tight Approximation Bounds for Maximum Multi-coverage
Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization
Tight Bounds for Permutation Flow Shop Scheduling
Optimization Problems on Matroids and Exponential Sums
On a Lemma of Scarf
A TDI Description of Restricted 2-Matching Polytopes
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
A Submodular Optimization Problem with Side Constraints
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
Zero-Coefficient Cuts
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
The Limits of Local Search for Weighted k-Set Packing
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
A Heuristic Algorithm for the Set Covering Problem
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
Total Dual Dyadicness and Dyadic Generating Sets
The Heterogeneous Capacitated k-Center Problem
Orbitopal Fixing
A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices
The Two-Point Fano and Ideal Binary Clutters
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs
Approximation Algorithms for the Mixed Postman Problem
Eight-Fifth Approximation for the Path TSP
Matroid-Based TSP Rounding for Half-Integral Solutions
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
Online Combinatorial Assignment in Independence Systems
Oriented Matroid Polytopes and Polyhedral Fans are Signable
Sparsity and Integrality Gap Transference Bounds for Integer Programs
0/1 Polytopes with Quadratic Chvátal Rank
A Polynomial Algorithm for Weighted Abstract Flow
Algorithms and Extended Formulations for One and Two Facility Network Design
Implementing Automatic Benders Decomposition in a Modern MIP Solver
Implications, Conflicts, and Reductions for Steiner Trees
Optimizing over the First Chvàtal Closure
Continuous Facility Location on Graphs
Intersection Cuts for Mixed Integer Conic Quadratic Sets
On a Min-max Theorem of Cacti
Smoothed Analysis of Integer Programming
On Lifting Integer Variables in Minimal Inequalities
An efficient approximation algorithm for the survivable network design problem
Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
The Throughput of Sequential Testing
On the Inefficiency of Equilibria in Congestion Games
Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption
On a Generalization of the Chvátal-Gomory Closure
Integer Programming and Incidence Treedepth
Backdoor Branching
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings
Shellability of Oriented Matroids
The Secretary Problem with Distributions
Sequence Independent Lifting for the Set of Submodular Maximization Problem
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio
Formulations for the stable set polytope of a claw-free graph
Conservative Weightings and Ear-Decompositions of Graphs
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators
A New Approach to the Stable Set Problem Based on Ellipsoids
Coupled and k-Sided Placements: Generalizing Generalized Assignment
Transitive Packing
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope
Decomposition of Probability Marginals for Security Games in Abstract Networks
The Set Connector Problem in Graphs
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
Equilibrium Computation in Atomic Splittable Singleton Congestion Games
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
On Polyhedra Related to Even Factors
A Class of Hard Small 0-1 Programs
On the Configuration LP for Maximum Budgeted Allocation
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem
An Extension of a Theorem of Henneberg and Laman
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
Reverse Chvátal-Gomory Rank
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
An Excluded Minor Characterization of Seymour Graphs
Pruning by Isomorphism in Branch-and-Cut
Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings
Improved Approximation Algorithms for Hitting 3-Vertex Paths
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
About the Complexity of Two-Stage Stochastic IPs
An Unconditional Lower Bound for the Active-Set Method on the Hypercube
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
Stabilizing Network Bargaining Games by Blocking Players
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
Lower Bounds on the Sizes of Integer Programs without Additional Variables
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
The Two-Stripe Symmetric Circulant TSP is in P
A Probabilistic Analysis of the Strength of the Split and Triangle Closures
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Integer Concave Cocirculations and Honeycombs
Computational Study of a Family of Mixed-Integer Quadratic Programming Problems
A Separation Routine for the Set Covering Polytope
On Ideal Clutters, Metrics and Multiflows
Optimizing Low Dimensional Functions over the Integers
Separation Problems for the Stable Set Polytope
The Price of Anarchy when Costs Are Non-separable and Asymmetric
Strongly Connected Orientations and Integer Lattices
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
Sign-Solvable Linear Complementarity Problems
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
Optimal and almost optimal algorithms for connectivity augmentation problems
On the Geometry of Symmetry Breaking Inequalities
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem
Convexity and Steinitz's Exchange Property
Reverse Split Rank
On the transitive acyclic subdigraph polytope
Inapproximability of Shortest Paths on Perfect Matching Polytopes
From Approximate to Exact Integer Programming
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
Symmetry Matters for the Sizes of Extended Formulations
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Centerpoints: A Link Between Optimization and Convex Geometry
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
On the Maximal Number of Columns of a $\varDelta $-modular Matrix
Cutting Planes for Mixed 0-1 Semidefinite Programs
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems
Prize-Collecting Steiner Network Problems
On 2-Connected Subgraph Polytopes
Extended Polymatroids: Properties and Optimization
Fast Combinatorial Algorithms for Efficient Sortation
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
Optimal Matching Forests and Valuated Delta-Matroids
On the Number of Degenerate Simplex Pivots
Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid
Sum-of-Squares Hierarchies for Binary Polynomial Optimization
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector
Linear Programming Using Limited-Precision Oracles
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
Graph Coloring Lower Bounds from Decision Diagrams
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation
A Polynomial-Time Algorithm for Optimizing over N -Fold 4-Block Decomposable Integer Programs
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices
The Random Linear Bottleneck Assignment Problem
The Induced Disjoint Paths Problem
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results
Split Closure and Intersection Cuts
The Constrained Minimum Weighted Sum of Job Completion Times Problem
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
A Polyhedral Approach to the Feedback Vertex Set Problem
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling
Combining Semidefinite and Polyhedral Relaxations for Integer Programs
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows
A general class of greedily solvable linear programs
The Packing Property
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Scheduling and Fixed-Parameter Tractability
A Characterization of Seymour Graphs
Valid Cuts for the Design of Potential-Based Flow Networks
Approximability of Capacitated Network Design
Popular Edges and Dominant Matchings
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
Cut-Sufficient Directed 2-Commodity Multiflow Topologies
On the Correlation Gap of Matroids
Optimal solution and value of parametric integer programs
A Complexity and Approximability Study of the Bilevel Knapsack Problem
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
Intersection Cuts for Polynomial Optimization
The Demand Matching Problem
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds
Online Algorithms for Spectral Hypergraph Sparsification
Cutting Planes from Wide Split Disjunctions
Enumeration of Integer Points in Projections of Unbounded Polyhedra
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
Cut-Generating Functions
Optimal Item Pricing in Online Combinatorial Auctions
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
Information Complexity of Mixed-Integer Convex Optimization
Combinatorial Benders' Cuts
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Combining and Strengthening Gomory Cuts
A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
A Complexity Index for Satisfiability Problems
Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
Polynomially Solvable Cases of the Simple Plant Location Problem
Separating k -sc Median from the Supplier Version
Inequalities from Two Rows of a Simplex Tableau
Integer Programming and Arrovian Social Welfare Functions
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
The Stochastic Machine Replenishment Problem
On the Quantile Cut Closure of Chance-Constrained Problems
Fixed Parameter Approximation Scheme for Min-Max k-Cut
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Monoidal Strengthening of Simple V -Polyhedral Disjunctive Cuts
The Path-Packing Structure of Graphs
An Improved Integrality Gap for Asymmetric TSP Paths
Forcing Colorations and the Strong Perfect Graph Conjecture
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
A Polyhedral Study of the Mixed Integer Cut
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
On Optimal Ear-Decompositions of Graphs
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract)
Single Machine Scheduling with Precedence Constraints: Extended Abstract
Combined Connectivity Augmentation and Orientation Problems
Constructing Lattice-Free Gradient Polyhedra in Dimension Two
Hard Equality Constrained Integer Knapsacks
Semi-streaming Algorithms for Submodular Matroid Intersection
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors
Universal Sequencing on a Single Machine
On Generalizations of Network Design Problems with Degree Bounds
A Semidefinite Bound for Mixing Rates of Markov Chains
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications
Scheduling Two Machines with Release Times
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
On the Congruency-Constrained Matroid Base
Optimal 3-Terminal Cuts and Linear Programming
Designing Optimization Problems with Diverse Solutions
Strong Mixed-Integer Programming Formulations for Trained Neural Networks
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
The Differentiable Feasibility Pump
On the MIR Closure of Polyhedra
Thrifty Algorithms for Multistage Robust Optimization
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization
Network Flow Problems with Electric Vehicles
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
On a Generalization of the Master Cyclic Group Polyhedron
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Sparse Graphs and an Augmentation Problem
Approximating the Advertisement Placement Problem
Convexification Techniques for Linear Complementarity Constraints
Flexible Graph Connectivity
Proximity Bounds for Random Integer Programs
Improved Approximations for Cubic Bipartite and Cubic TSP
A 3-Approximation for Facility Location with Uniform Capacities
Routing in grid graphs by cutting planes
Finding a Polytope from Its Graph in Polynomial Time
An FPTAS for Connectivity Interdiction
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
On the Rank of Cutting-Plane Proof Systems
New Classes of Lower Bounds for Bin Packing Problems
Fast Quantum Subroutines for the Simplex Method
Totally $\varDelta $-Modular IPs with Two Non-zeros in Most Rows
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
On the Recognition of a, b, c-Modular Matrices
An Orientation Theorem with Parity Conditions
Linear Programming Hierarchies Suffice for Directed Steiner Tree
On Column-Restricted and Priority Covering Integer Programs
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints
Fences Are Futile: On Relaxations for the Linear Ordering Problem
Algorithms and Min-max Theorems for Certain Multiway Cuts
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
Approximating k -Set Cover and Complementary Graph Coloring
Strong Reductions for Extended Formulations
The Triangle Splitting Method for Biobjective Mixed Integer Programming
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
Robust Monotone Submodular Function Maximization
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
A Simple Method for Convex Optimization in the Oracle Model
Approximation Algorithms for Stochastic Inventory Control Models
A Robust Optimization Approach to Supply Chain Management
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
On the Power of Static Assignment Policies for Robust Facility Location Problems
Integer Quadratic Quasi-polyhedra
Solving the maximum weight planar subgraph
A Polyhedral Study of the Cardinality Constrained Knapsack Problem
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization
Neural Networks with Linear Threshold Activations: Structure and Algorithms
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
Approximately Packing Dijoins via Nowhere-Zero Flows
Facial Structure and Representation of Integer Hulls of Convex Sets
Test Sets and Inequalities for Integer Programs
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs
A Polyhedral Approach to Surface Reconstruction from Planar Contours
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
A Supermodular Relaxation for Scheduling with Release Dates
Intersecting and Dense Restrictions of Clutters in Polynomial Time
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
Separating Maximally Violated Comb Inequalities in Planar Graphs
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine
Universal Packet Routing with Arbitrary Bandwidths and Transit Times
Improving the Integrality Gap for Multiway Cut
A Minimal Algorithm for the Bounded Knapsack Problem
Online Submodular Maximization: Beating 1/2 Made Simple
A Lower Bound for the Max Entropy Algorithm for TSP
Fully-Dynamic Load Balancing
An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case
Hitting Diamonds and Growing Cacti
A Technique for Obtaining True Approximations for k-Center with Covering Constraints
Subgraph Degree-Sequence Polyhedra
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times
Edge-Splitting Problems with Demands
On the Mixed Binary Representability of Ellipsoidal Regions
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems
A Genetic Algorithm for the Assembly Line Balancing Problem
Polyhedral Results for the Precedence-Constrained Knapsack Problem
A Utility Equivalence Theorem for Concave Functions
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques
Optimal General Factor Problem and Jump System Intersection
Stabilization of Capacitated Matching Games
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
LP-Based Online Scheduling: From Single to Parallel Machines
An Exact Rational Mixed-Integer Programming Solver
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990
Robust Combinatorial Optimization with Exponential Scenarios
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
Solving the Convex Cost Integer Dual Network Flow Problem
The Polyhedral Geometry of Truthful Auctions
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
Degree Bounded Forest Covering
The Simultaneous Semi-random Model for TSP
Perfection, Parity, Planarity, and Packing Paths
Content Placement via the Exponential Potential Function Method
Network Improvement for Equilibrium Routing
Jump Number of Two-Directional Orthogonal Ray Graphs
On Minimum 3-Cuts and Approximating k -Cuts Using Cut Trees
Algorithms for Flows over Time with Scheduling Costs
A Technique for Speeding up the Solution of the Lagrangian Dual
Incorporating Inequality Constraints in the Spectral Bundle Method