Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings. (Q1889609)

From MaRDI portal





scientific article; zbMATH DE number 2121179
Language Label Description Also known as
default for all languages
No label defined
    English
    Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings.
    scientific article; zbMATH DE number 2121179

      Statements

      Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings. (English)
      0 references
      6 December 2004
      0 references
      The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0992.00060). Indexed articles: \textit{Fukasawa, Ricardo; Lysgaard, Jens; Poggi de Aragão, Marcus; Reis, Marcelo; Uchoa, Eduardo; Werneck, Renato F.}, Robust branch-and-Cut-and-Price for the capacitated vehicle routing problem, 1-15 [Zbl 1092.90540] \textit{Avella, Pasquale; Mattia, Sara; Sassano, Antonio}, Metric inequalities and the network loading problem, 16-32 [Zbl 1092.90006] \textit{Dash, Sanjeeb; Günlük, Oktay}, Valid inequalities based on simple mixed-integer sets, 33-45 [Zbl 1092.90032] \textit{Perakis, G.}, The price of anarchy when costs are non-separable and asymmetric, 46-58 [Zbl 1092.90012] \textit{Correa, José R.; Schulz, Andreas S.; Stier Moses, Nicolás E.}, Computational complexity, fairness, and the price of anarchy of the maximum latency problem, 59-73 [Zbl 1092.90515] \textit{Lozovanu, Dmitrii}, Polynomial time algorithm for determining optimal strategies in cyclic games, 74-85 [Zbl 1092.91011] \textit{Bertsimas, Dimitris; Thiele, Aurélie}, A robust optimization approach to supply chain management, 86-100 [Zbl 1092.90521] \textit{Ravi, R.; Sinha, Amitabh}, Hedging uncertainty: Approximation algorithms for stochastic optimization problems, 101-115 [Zbl 1092.90531] \textit{Asgeirsson, Eyjolfur; Berry, Jonathan; Phillips, Cynthia A.; Phillips, David J.; Stein, Cliff; Wein, Joel}, Scheduling an industrial production facility, 116-131 [Zbl 1092.90513] \textit{Bessy, Stéphane; Thomassé, Stéphan}, Three min-max theorems concerning cyclic orders of strong digraphs, 132-138 [Zbl 1093.05504] \textit{Pap, Gyula}, A TDI description of restricted 2-matching polytopes, 139-151 [Zbl 1092.90054] \textit{Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.}, Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems, 152-162 [Zbl 1092.68074] \textit{de Farias, I. R. jun.}, Semi-continuous cuts for mixed-integer programming, 163-177 [Zbl 1092.90530] \textit{Codato, Gianni; Fischetti, Matteo}, Combinatorial Benders' cuts, 178-195 [Zbl 1092.90529] \textit{Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver}, A faster exact separation algorithm for blossom inequalities, 196-205 [Zbl 1092.90542] \textit{Levi, Retsef; Shmoys, David B.; Swamy, Chaitanya}, LP-based approximation algorithms for capacitated facility location, 206-218 [Zbl 1092.90524] \textit{Zhang, Jiawei; Chen, Bo; Ye, Yinyu}, A multi-exchange local search algorithm for the capacitated facility location problem, 219-233 [Zbl 1092.90525] \textit{Magnanti, Thomas L.; Stratila, Dan}, Separable concave optimization approximately equals piecewise linear optimization, 234-243 [Zbl 1092.90533] \textit{De Loera, J. A.; Haws, D.; Hemmecke, R.; Huggins, P.; Yoshida, R.}, Three kinds of integer programming algorithms based on Barvinok's rational functions, 244-255 [Zbl 1092.90528] \textit{Sebő, András; Szegő, László}, The path-packing structure of graphs, 256-270 [Zbl 1093.05512] \textit{Lee, Jon; Margot, François}, More on a binary-encoded coloring formulation, 271-282 [Zbl 1093.05503] \textit{Correa, José R.; Schulz, Andreas S.}, Single machine scheduling with precedence constraints, 283-297 [Zbl 1092.90514] \textit{Levin, Asaf; Woeginger, Gerhard J.}, The constrained minimum weighted sum of job completion times problem, 298-307 [Zbl 1092.90517] \textit{Vygen, Jens}, Near-optimum global routing with coupling, delay bounds, and power consumption, 308-324 [Zbl 1092.68002] \textit{Lang, Kevin; Rao, Satish}, A flow-based method for improving the expansion or conductance of graph cuts, 325-337 [Zbl 1092.68631] \textit{De Loera, Jesus; Onn, Shmuel}, All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables, 338-351 [Zbl 1092.90029] \textit{Iwata, Satoru; Moriguchi, Satoko; Murota, Kazuo}, A capacity scaling algorithm for M-convex submodular flow, 352-367 [Zbl 1092.90007] \textit{Karzanov, Alexander V.}, Integer concave cocirculations and honeycombs, 368-387 [Zbl 1092.90038] \textit{Apollonio, Nicola; Sebő, András}, Minsquare factors and maxfix covers of graphs, 388-400 [Zbl 1093.05509] \textit{Kaibel, Volker}, Low-dimensional faces of random 0/1-polytopes, 401-415 [Zbl 1092.52005] \textit{Király, Tamás; Makai, Márton}, On polyhedra related to even factors, 416-430 [Zbl 1093.05511] \textit{Frangioni, Antonio; Lodi, Andrea; Rinaldi, Giovanni}, Optimizing over semimetric polytopes, 431-443 [Zbl 1131.90442]
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references