Search results for "Math. Program."

Hits ?▲	Authors	Title	Venue	Year	Link
1	Jing Hu, John E. Mitchell, Jong-Shi Pang	An LPCC approach to nonconvex quadratic programs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Dimitris Magos, Ioannis Mourtos, Gautam Appa	A polyhedral approach to the alldifferent system.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Alessandro Agnetis, Enrico Grande, Andrea Pacifici	Demand allocation with latency cost functions.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Nick I. M. Gould, Philippe L. Toint	Erratum to: Nonlinear programming without a penalty function or a filter.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Edwin O'Shea, András Sebö	Alternatives for testing total dual integrality.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Konstantin Avrachenkov, Regina Sandra Burachik, Jerzy A. Filar, Vladimir Gaitsgory	Constraint augmentation in pseudo-singularly perturbed linear programs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Richard H. Byrd, Gabriel López-Calva, Jorge Nocedal	A line search exact penalty method using steering rules.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis	New results on the Windy Postman Problem.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Guyslain Naves	The hardness of routing two pairs on one face.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Simge Küçükyavuz	On mixing sets arising in chance-constrained programming.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Henning Bruhn, Maya Stein	On claw-free t-perfect graphs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Lingchen Kong, Levent Tunçel, Naihua Xiu	Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Luís N. Vicente, A. L. Custódio	Analysis of direct searches for discontinuous functions.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Hélène Frankowska, Marc Quincampoix	Hölder metric regularity of set-valued maps.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh	An implementable proximal point algorithmic framework for nuclear norm minimization.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Sebastian Sager, Hans Georg Bock, Moritz Diehl	The integer approximation error in mixed-integer optimal control.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Jian Hu, Tito Homem-de-Mello, Sanjay Mehrotra	Sample average approximation of stochastic dominance constrained programs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Andrew Gilpin, Javier Peña, Tuomas Sandholm	First-order algorithm with $${\mathcal{O}({\rm ln}(1{/}\epsilon))}$$ convergence for $${\epsilon}$$ -equilibrium in two-person zero-sum games.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Rida Laraki, Jean B. Lasserre	Semidefinite programming for min-max problems and games.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Oliver Stein	Lifting mathematical programs with complementarity constraints.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Douglas A. G. Vieira, Ricardo H. C. Takahashi, Rodney R. Saldanha	Multicriteria optimization with a multiobjective golden section line search.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük	The master equality polyhedron with multiple rows.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Hiroshi Yamashita, Hiroshi Yabe	Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	S. Dempe, J. Dutta	Is bilevel programming a special case of a mathematical program with complementarity constraints?	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Alain Billionnet, Sourour Elloumi, Amélie Lambert	Extending the QCR method to general mixed-integer programs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	João Gouveia, Monique Laurent, Pablo A. Parrilo, Rekha R. Thomas	A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer	Two-stage quadratic integer programs with stochastic right-hand sides.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Anna von Heusinger, Christian Kanzow, Masao Fukushima	Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli	A counterexample to a conjecture of Gomory and Johnson.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Frank Göring, Christoph Helmberg, Susanna Reiss	Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Zhaosong Lu, Renato D. C. Monteiro, Ming Yuan	Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Frank Plastria, Emilio Carrizosa	Minmax-distance approximation and separation problems: geometrical properties.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Adam N. Letchford, Michael M. Sørensen	Binary positive semidefinite matrices and associated integer polytopes.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Guanghui Lan	An optimal method for stochastic composite optimization.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Alper Atamtürk, Kiavash Kianfar	n-step mingling inequalities: new facets for the mixed-integer knapsack set.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Hubertus Th. Jongen, Vladimir Shikhman, Sonja Steffensen	Characterization of strong stability for C-stationary points in MPCC.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Zhisu Zhu, Chuangyin Dang, Yinyu Ye	A FPTAS for computing a symmetric Leontief competitive economy equilibrium.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Peter Bürgisser, Dennis Amelunxen	Robust smoothed analysis of a condition number for linear programming.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Leah Epstein, Asaf Levin	Bin packing with general cost structures.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Kenjiro Takazawa	A weighted independent even factor algorithm.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Jiawang Nie	First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Yuji Matsuoka	Fractional packing in ideal clutters.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Daniel Aloise, Pierre Hansen, Leo Liberti	An improved column generation algorithm for minimum sum-of-squares clustering.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Jong-Shi Pang, Lanshan Han, Gitakrishnan Ramadurai, Satish V. Ukkusuri	A continuous-time linear complementarity system for dynamic user equilibria in single bottleneck traffic flows.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov	Clique-based facets for the precedence constrained knapsack problem.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Daniel Bienstock, Benjamin McClosky	Tightening simple mixed-integer sets with guaranteed bounds.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Ulrich Faigle, Walter Kern, Britta Peis	A ranking model for the greedy algorithm and discrete convexity.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Ying-Ju Chen, Jiawei Zhang	Design of price mechanisms for network resource allocation via price of anarchy.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Alexey F. Izmailov, Mikhail V. Solodov	Stabilized SQP revisited.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Etienne de Klerk, Renata Sotirov	Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Leo Liberti	Reformulations in mathematical programming: automatic symmetry detection and exploitation.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Hideaki Iiduka	Fixed point optimization algorithm and its application to power control in CDMA data networks.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Retsef Levi, David B. Shmoys, Chaitanya Swamy	LP-based approximation algorithms for capacitated facility location.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Júlia Pap	Recognizing conic TDI systems is hard.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Wenhui Zhao, Marc E. Posner	A large class of facets for the K-median polytope.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Luis Gouveia, Luidi Simonetti, Eduardo Uchoa	Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini	Improved strategies for branching on general disjunctions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alper Atamtürk, Vishnu Narayanan	Lifting for conic mixed-integer programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	John Dunagan, Daniel A. Spielman, Shang-Hua Teng	Smoothed analysis of condition numbers and complexity implications for linear programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Csaba I. Fábián, Gautam Mitra, Diana Roman	Processing second-order stochastic dominance models using cutting-plane representations.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anatoli Juditsky, Arkadi Nemirovski	On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anthony Man-Cho So	Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Wenbao Ai, Yongwei Huang, Shuzhong Zhang	New results on Hermitian matrix rank-one decomposition.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh	Bilinear optimality constraints for the cone of positive polynomials.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Arrigo Zanette, Matteo Fischetti, Egon Balas	Lexicography and degeneracy: can a pure cutting plane algorithm work?	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani	Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Aharon Ben-Tal, Sahely Bhadra, Chiranjib Bhattacharyya, J. Saketha Nath	Chance constrained uncertain classification via robust optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Patrick D. Mackin, Asim Roy, Jyrki Wallenius	An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Miguel F. Anjos, Etienne de Klerk, Franz Rendl	Preface.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Matteo Fischetti, Andrea Lodi, Andrea Tramontani	On the separation of disjunctive cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura	Efficient branch-and-bound algorithms for weighted MAX-2-SAT.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang	A stackelberg game approach to distributed spectrum management.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Juan Pablo Vielma, George L. Nemhauser	Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anureet Saxena, Pierre Bonami, Jon Lee	Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Shu Lu	Implications of the constant rank constraint qualification.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Paul Tseng, Immanuel M. Bomze, Werner Schachinger	A first-order interior-point method for linearly constrained smooth optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Zhaosong Lu	A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Santanu S. Dey	A note on the split rank of intersection cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Jochen Könemann, David Pritchard, Kunlun Tan	A partition-based relaxation for Steiner trees.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Jordi Castro, Jordi Cuesta	Quadratic regularizations in an interior-point method for primal block-angular problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani	New geometry-inspired relaxations and algorithms for the metric Steiner tree problem.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Khalid Addi, Bernard Brogliato, Daniel Goeleven	A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Raymond Hemmecke, Shmuel Onn, Robert Weismantel	A polynomial oracle-time algorithm for convex integer minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dimitri P. Bertsekas	Incremental proximal methods for large scale convex optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Sangwoon Yun, Paul Tseng, Kim-Chuan Toh	A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Daniel Kuhn, Wolfram Wiesemann, Angelos Georghiou	Primal and dual linear decision rules in stochastic and robust optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Marco Colombo, Jacek Gondzio, Andreas Grothey	A warm-start approach for large-scale stochastic linear programs.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio	Orbital branching.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	François Vanderbeck	Branching in branch-and-price: a generic scheme.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alexandre d'Aspremont, Laurent El Ghaoui	Testing the nullspace property using semidefinite programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys	Approximation algorithms for supply chain planning and logistics problems with market choice.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anatoli Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski	Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Yurii Nesterov	Barrier subgradient method.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Justo Puerto, Antonio M. Rodríguez-Chía	On the structure of the solution set for the single facility location problem with average distances.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Roberto Andreani, Joaquim João Júdice, J. M. Martínez, Joao Patrício	On the natural merit function for solving complementarity problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dongdong Ge, Xiaoye Jiang, Yinyu Ye	A note on the complexity of Lp minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dimitri P. Bertsekas, Zhi-Quan Luo	Preface.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot	On the relative strength of split, triangle and quadrilateral cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaojun Chen 0001, Shuhuang Xiang	Implicit solution function of P0 and Z matrix linear complementarity constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF

Publications at "Math. Program."( http://dblp.L3S.de/Venues/Math._Program. )