Conferences in DBLP
Michel X. Goemans Polyhedral Description of Trees and Arborescences. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Chopra The K-Edge Connected Spanning Subgraph Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Barahona , Ali Ridha Mahjoub On 2-Connected Subgraph Polytopes. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit S. Hochbaum , Joseph Naor Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Naoyoshi Kanamaru , Takao Nishizeki , Tetsuo Asano Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Alan M. Frieze Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] András Frank , Alexander V. Karzanov , András Sebö On Multiflow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Farhad Shahrokhi , László A. Székely Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Pavol Hell , Jing Huang Recognition and Representation of Proper Circular Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] J. A. Hoogeveen , H. Oosterhout , Steef L. van de Velde New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. [Citation Graph (0, 0)][DBLP ] Conf ] Jean B. Lasserre , Maurice Queyranne Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Pochet , Laurence A. Wolsey Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Hansen , Brigitte Jaumard , Marcus Poggi de Aragão Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Silvano Martello , François Soumis , Paolo Toth An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Nobili , Antonio Sassano A Separation Routine for the Set Covering Polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Yves Crama , Peter L. Hammer , Michael E. Saks A Complexity Index for Satisfiability Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Guoliang Xue , J. Ben Rosen , Panos M. Pardalos A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev A Criterion of Polynomial-Time Solvability for the Network Location Problem. [Citation Graph (0, 0)][DBLP ] Conf ] William H. Cunningham , Fan Zhang Subgraph Degree-Sequence Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Matteo Fischetti Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Monique Laurent , Svatopluk Poljak The Metric Polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Helman , Bernard M. E. Moret , Henry D. Shapiro An Exact Characterization of Greedy Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Partha P. Bhattacharya , Leonidas Georgiadis , Pantelis Tsoucas Extended Polymatroids: Properties and Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok Optimization Problems on Matroids and Exponential Sums. [Citation Graph (0, 0)][DBLP ] Conf ] Péter L. Erdös , László A. Székely Algorithms and Min-max Theorems for Certain Multiway Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Cor A. J. Hurkens Nasty TSP Instances for Farthest Insertion. [Citation Graph (0, 0)][DBLP ] Conf ] András Sebö Forcing Colorations and the Strong Perfect Graph Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Lov K. Grover Fast Parallel Algorithms for Bipartite Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Farid Alizadeh Combinatorial Optimization with Semi-Definite Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Narendra Karmarkar , S. A. Thakur An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Bienstock A Lot-Sizing Problem on Trees, Related to Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Bertsimas , James B. Orlin A Technique for Speeding up the Solution of the Lagrangian Dual. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Richard M. Karp , Bruce A. Reed When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? [Citation Graph (0, 0)][DBLP ] Conf ] 