:facetid:toc:\"db/journals/disopt/disopt4.bht\"OK:facetid:toc:db/journals/disopt/disopt4.bhtTobias AchterbergConflict analysis in mixed integer programming.Discret. Optim.414-202007Journal Articlesopenjournals/disopt/Achterberg0710.1016/J.DISOPT.2006.10.006https://doi.org/10.1016/j.disopt.2006.10.006https://dblp.org/rec/journals/disopt/Achterberg07URL#5456097Tobias AchterbergTimo BertholdImproving the feasibility pump.Discret. Optim.4177-862007Journal Articlesopenjournals/disopt/AchterbergB0710.1016/J.DISOPT.2006.10.004https://doi.org/10.1016/j.disopt.2006.10.004https://dblp.org/rec/journals/disopt/AchterbergB07URL#5456098Pasquale AvellaSara MattiaAntonio SassanoMetric inequalities and the Network Loading Problem.Discret. Optim.41103-1142007Journal Articlesopenjournals/disopt/AvellaMS0710.1016/J.DISOPT.2006.10.002https://doi.org/10.1016/j.disopt.2006.10.002https://dblp.org/rec/journals/disopt/AvellaMS07URL#5456099Jørgen Bang-JensenDaniel Gonçalves 0001Inge Li GørtzFinding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.Discret. Optim.43-4334-3482007Journal Articlesopenjournals/disopt/Bang-JensenGG0710.1016/J.DISOPT.2007.09.003https://doi.org/10.1016/j.disopt.2007.09.003https://dblp.org/rec/journals/disopt/Bang-JensenGG07URL#5456100Nikhil Bansal 0001Maxim SviridenkoTwo-dimensional bin packing with one-dimensional resource augmentation.Discret. Optim.42143-1532007Journal Articlesopenjournals/disopt/BansalS0710.1016/J.DISOPT.2006.09.001https://doi.org/10.1016/j.disopt.2006.09.001https://dblp.org/rec/journals/disopt/BansalS07URL#5456101Livio BertaccoMatteo FischettiAndrea Lodi 0001A feasibility pump heuristic for general mixed-integer problems.Discret. Optim.4163-762007Journal Articlesopenjournals/disopt/BertaccoFL0710.1016/J.DISOPT.2006.10.001https://doi.org/10.1016/j.disopt.2006.10.001https://dblp.org/rec/journals/disopt/BertaccoFL07URL#5456102Daniel BienstockSara MattiaUsing mixed-integer programming to solve power grid blackout problems.Discret. Optim.41115-1412007Journal Articlesopenjournals/disopt/BienstockM0710.1016/J.DISOPT.2006.10.007https://doi.org/10.1016/j.disopt.2006.10.007https://dblp.org/rec/journals/disopt/BienstockM07URL#5456103Jacek BlazewiczPiotr FormanowiczMarta KasprzakPetra SchuurmanGerhard J. WoegingerA polynomial time equivalence between DNA sequencing and the exact perfect matching problem.Discret. Optim.42154-1622007Journal Articlesopenjournals/disopt/BlazewiczFKSW0710.1016/J.DISOPT.2006.07.004https://doi.org/10.1016/j.disopt.2006.07.004https://dblp.org/rec/journals/disopt/BlazewiczFKSW07URL#5456104Endre BorosYves CramaBruno SimeonePeter Ladislaw Hammer: December 23, 1936-December 27, 2006.Discret. Optim.43-4257-2592007Journal Articlesopenjournals/disopt/BorosCS0710.1016/J.DISOPT.2007.11.001https://doi.org/10.1016/j.disopt.2007.11.001https://dblp.org/rec/journals/disopt/BorosCS07URL#5456105Peter ButkovicSeth LewisOn the job rotation problem.Discret. Optim.42163-1742007Journal Articlesopenjournals/disopt/ButkovicL0710.1016/J.DISOPT.2006.11.003https://doi.org/10.1016/j.disopt.2006.11.003https://dblp.org/rec/journals/disopt/ButkovicL07URL#5456106T. C. Edwin ChengNatalia V. ShakhlevichTwo-machine open shop problem with controllable processing times.Discret. Optim.42175-1842007Journal Articlesopenjournals/disopt/ChengS0710.1016/J.DISOPT.2006.10.010https://doi.org/10.1016/j.disopt.2006.10.010https://dblp.org/rec/journals/disopt/ChengS07URL#5456107Leah EpsteinRob van SteeBounds for online bounded space hypercube packing.Discret. Optim.42185-1972007Journal Articlesopenjournals/disopt/EpsteinS0710.1016/J.DISOPT.2006.11.005https://doi.org/10.1016/j.disopt.2006.11.005https://dblp.org/rec/journals/disopt/EpsteinS07URL#5456108Leah EpsteinRob van SteeOnline bin packing with resource augmentation.Discret. Optim.43-4322-3332007Journal Articlesopenjournals/disopt/EpsteinS07a10.1016/J.DISOPT.2007.09.004https://doi.org/10.1016/j.disopt.2007.09.004https://dblp.org/rec/journals/disopt/EpsteinS07aURL#5456109Bruno EscoffierPeter L. HammerApproximation of the Quadratic Set Covering problem.Discret. Optim.43-4378-3862007Journal Articlesopenjournals/disopt/EscoffierH0710.1016/J.DISOPT.2007.10.001https://doi.org/10.1016/j.disopt.2007.10.001https://dblp.org/rec/journals/disopt/EscoffierH07URL#5456110Nathalie FaurePhilippe ChrétienneÉric GourdinFrancis SourdBiclique completion problems for multicast network design.Discret. Optim.43-4360-3772007Journal Articlesopenjournals/disopt/FaureCGS0710.1016/J.DISOPT.2007.09.005https://doi.org/10.1016/j.disopt.2007.09.005https://dblp.org/rec/journals/disopt/FaureCGS07URL#5456111Takuro FukunagaHiroshi NagamochiGeneralizing the induced matching by edge capacity constraints.Discret. Optim.42198-2052007Journal Articlesopenjournals/disopt/FukunagaN0710.1016/J.DISOPT.2006.11.004https://doi.org/10.1016/j.disopt.2006.11.004https://dblp.org/rec/journals/disopt/FukunagaN07URL#5456112Yongpei GuanShabbir Ahmed 0001George L. NemhauserSequential pairing of mixed integer inequalities.Discret. Optim.4121-392007Journal Articlesopenjournals/disopt/GuanAN0710.1016/J.DISOPT.2006.10.003https://doi.org/10.1016/j.disopt.2006.10.003https://dblp.org/rec/journals/disopt/GuanAN07URL#5456113Xiaoyun JiJohn E. Mitchell 0001Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement.Discret. Optim.4187-1022007Journal Articlesopenjournals/disopt/JiM0710.1016/J.DISOPT.2006.10.009https://doi.org/10.1016/j.disopt.2006.10.009https://dblp.org/rec/journals/disopt/JiM07URL#5456114Gerard van der LaanDolf TalmanZaifu YangComputing integral solutions of complementarity problems.Discret. Optim.43-4315-3212007Journal Articlesopenjournals/disopt/LaanTY0710.1016/J.DISOPT.2007.09.001https://doi.org/10.1016/j.disopt.2007.09.001https://dblp.org/rec/journals/disopt/LaanTY07URL#5456115Jon Lee 0001Adam N. LetchfordMixed integer programming.Discret. Optim.411-22007Journal Articlesopenjournals/disopt/LeeL0710.1016/J.DISOPT.2006.10.005https://doi.org/10.1016/j.disopt.2006.10.005https://dblp.org/rec/journals/disopt/LeeL07URL#5456116François MargotSymmetric ILP: Coloring and small integers.Discret. Optim.4140-622007Journal Articlesopenjournals/disopt/Margot0710.1016/J.DISOPT.2006.10.008https://doi.org/10.1016/j.disopt.2006.10.008https://dblp.org/rec/journals/disopt/Margot07URL#5456117Laura A. McLaySheldon H. JacobsonAlgorithms for the bounded set-up knapsack problem.Discret. Optim.42206-2122007Journal Articlesopenjournals/disopt/McLayJ0710.1016/J.DISOPT.2006.11.002https://doi.org/10.1016/j.disopt.2006.11.002https://dblp.org/rec/journals/disopt/McLayJ07URL#5456118Luc MercierPascal Van HentenryckStrong polynomiality of resource constraint propagation.Discret. Optim.43-4288-3142007Journal Articlesopenjournals/disopt/MercierH0710.1016/J.DISOPT.2007.01.001https://doi.org/10.1016/j.disopt.2007.01.001https://dblp.org/rec/journals/disopt/MercierH07URL#5456119Kiyohito NaganoA strongly polynomial algorithm for line search in submodular polyhedra.Discret. Optim.43-4349-3592007Journal Articlesopenjournals/disopt/Nagano0710.1016/J.DISOPT.2007.09.002https://doi.org/10.1016/j.disopt.2007.09.002https://dblp.org/rec/journals/disopt/Nagano07URL#5456120Alexander D. ScottGregory B. SorkinLinear-programming design and analysis of fast algorithms for Max 2-CSP.Discret. Optim.43-4260-2872007Journal Articlesopenjournals/disopt/ScottS0710.1016/J.DISOPT.2007.08.001https://doi.org/10.1016/j.disopt.2007.08.001https://dblp.org/rec/journals/disopt/ScottS07URL#5456121Michael Malmros SørensenFacet-defining inequalities for the simple graph partitioning polytope.Discret. Optim.42221-2312007Journal Articlesopenjournals/disopt/Sorensen0710.1016/J.DISOPT.2006.08.001https://doi.org/10.1016/j.disopt.2006.08.001https://dblp.org/rec/journals/disopt/Sorensen07URL#5456122Wilbert E. WilhelmNilanjan D. ChoudhuryPurushothaman DamodaranA model to optimize placement operations on dual-head placement machines.Discret. Optim.42232-2562007Journal Articlesopenjournals/disopt/WilhelmCD0710.1016/J.DISOPT.2006.11.006https://doi.org/10.1016/j.disopt.2006.11.006https://dblp.org/rec/journals/disopt/WilhelmCD07URL#5456123Gerhard J. WoegingerJirí SgallOn the complexity of cake cutting.Discret. Optim.42213-2202007Journal Articlesopenjournals/disopt/WoegingerS0710.1016/J.DISOPT.2006.07.003https://doi.org/10.1016/j.disopt.2006.07.003https://dblp.org/rec/journals/disopt/WoegingerS07URL#5456124