Research Article610.1016/j.disopt.2014.01.001The quadratic balanced optimization problemFeb 12, 2014Discrete OptimizationAbraham P Punnen + 3 more +3CiteListenSave
Research Article110.1016/j.disopt.2012.06.002Lattice-based algorithms for number partitioning in the hard phaseJul 20, 2012Discrete OptimizationBala Krishnamoorthy + 2 more +2CiteListenSave
Research Article910.1016/j.disopt.2012.02.004How tight is the corner relaxation? Insights gained from the stable set problemMar 05, 2012Discrete OptimizationGérard Cornuéjols + 2 more +2CiteListenSave
Research Article510.1016/j.disopt.2012.02.003An algorithm for finding a maximum [formula omitted]-matching excluding complete partite subgraphsFeb 24, 2012Discrete OptimizationYusuke Kobayashi + 1 more +1CiteListenSave
Research Article3010.1016/j.disopt.2012.02.001On dynamic monopolies of graphs: The average and strict majority thresholdsFeb 23, 2012Discrete OptimizationKaveh Khoshkhah + 2 more +2CiteListenSave
Research Article510.1016/j.disopt.2011.03.001On duality and fractionality of multicommodity flows in directed networksApr 02, 2011Discrete OptimizationHiroshi Hirai + 1 more +1CiteListenSave
Research Article12810.1016/j.disopt.2010.07.005An exact approach for the Vertex Coloring ProblemAug 21, 2010Discrete OptimizationEnrico Malaguti + 2 more +2CiteListenSave
Research Article610.1016/j.disopt.2010.07.002Using Markov chains to analyze the effectiveness of local search algorithmsAug 03, 2010Discrete OptimizationAlexander G Nikolaev + 1 more +1CiteListenSave
Research Article2310.1016/j.disopt.2010.06.001Composite lifting of group inequalities and an application to two-row mixing inequalitiesJul 09, 2010Discrete OptimizationSantanu S Dey + 1 more +1CiteListenSave
Research Article610.1016/j.disopt.2010.03.007Minmax regret bottleneck problems with solution-induced interval uncertainty structureApr 21, 2010Discrete OptimizationIgor AverbakhCiteListenSave