the proceedings contain 32 papers. the topics discussed include: perspective relaxation of mixed integer nonlinear programs with indicator variables;disjunctive cuts for non-convex mixed integer quadratically constrai...
详细信息
ISBN:
(纸本)3540688862
the proceedings contain 32 papers. the topics discussed include: perspective relaxation of mixed integer nonlinear programs with indicator variables;disjunctive cuts for non-convex mixed integer quadratically constrained programs;the air traffic flow management problem: an integeroptimization approach;the induced disjoint paths problem;a new algorithm for the maximum weighted stable set problem in claw-free graphs;a polynomial algorithm for weighted abstract flow;a comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem;binary positive semidefinite matrices and associated integer polytopes;vertex cover resists SDPs tightened by local hypermetric inequalities;tight bounds for permutation flow shop scheduling;the stochastic machine replenishment problem;a polynomial time approximation scheme for the square packing problem;and constraint orbital branching.
the proceedings contain 34 papers from the integerprogramming and combinatorialoptimization: 11thinternational IPCO conference, Proceedings. the topics discussed include: mixed-integer cuts from cyclic groups;optim...
详细信息
the proceedings contain 34 papers from the integerprogramming and combinatorialoptimization: 11thinternational IPCO conference, Proceedings. the topics discussed include: mixed-integer cuts from cyclic groups;optimization over the first chvátal closure;a combinatorial algorithm to find a maximum even factor;improved approximation schemes for linear programming relaxations of combinatorialoptimization problems;on the approximability of the minimum congestion unsplittable shortest path routing problem;inventory and facility location models with market selection;and on approximation complex quadratic optimization problems via semidefinite programming relaxations.
the proceedings contain 36 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: On scheduling coflows;integrality gaps of integer knapsack problems...
ISBN:
(纸本)9783319592497
the proceedings contain 36 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: On scheduling coflows;integrality gaps of integer knapsack problems;approximation of corner polyhedra with families of intersection cuts;the structure of the infinite models in integerprogramming;mixed-integer linear representability, disjunctions, and variable elimination;cutting planes from wide split disjunctions;the heterogeneous capacitated k-center problem;local guarantees in graph cuts and clustering;verifying integerprogramming results;long term behavior of dynamic equilibria in fluid queuing networks;approximation algorithm for the maximum traveling salesman problem;minimizing multimodular functions and allocating capacity in bike-sharing systems;stochastic online scheduling on unrelated machines;beating half for random arrival;an improved deterministic rescaling for linear programming algorithms;a quasi-polynomial approximation for the restricted assignment problem;adaptive submodular ranking;minimum birkhoff-von Neumann decomposition;maximum matching in the online batch-arrival model;budget feasible mechanisms on matroids;deterministic discrepancy minimization via the multiplicative weight update method;mixed-integer convex representability;high degree sum of squares proofs, bienstock-zuckerberg hierarchy and cg cuts;enumeration of integer points in projections of unbounded polyhedra and equilibrium computation in atomic splittable singleton congestion games.
the proceedings contain 36 papers. the topics discussed include: inequalities from two rows of a simplex tableau;cuts for conic mixed-integerprogramming;sequential-merge facets for two-dimensional group problems;tria...
详细信息
ISBN:
(纸本)9783540727910
the proceedings contain 36 papers. the topics discussed include: inequalities from two rows of a simplex tableau;cuts for conic mixed-integerprogramming;sequential-merge facets for two-dimensional group problems;triangle-free simple 2-matchings in subcubic graphs;the smoothed number of Pareto optimal solutions in bicriteria integeroptimization;finding a polytope from its graph in polynomial time;orbitopal fixing;orbital branching;distinct triangle areas in a planar point set;scheduling with precedence constraints of low fractional dimension;approximation algorithms for 2-stage stochastic scheduling problems;on integerprogramming and the branch-width of the constraint matrix;matching problems in polymatroids without double circuits;maximizing a submodular set function subject to a matroid constraint;on a generalization of the master cyclic group polyhedron;and a framework to derive multidimensional superadditive lifting functions and its applications.
the proceedings contain 33 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: On approximation algorithms for concave mixed-integer quadratic pro...
ISBN:
(纸本)9783319334608
the proceedings contain 33 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: On approximation algorithms for concave mixed-integer quadratic programming;a link between optimization and convex geometry;rescaled coordinate descent methods for linear programming;approximating min-cost chain-constrained spanning trees;max-cut under graph constraints;sparsest cut in planar graphs, maximum concurrent flows and their connections withthe max-cut problem;intersection cuts for bilevel optimization;exact algorithms for the chance-constrained vehicle routing problem;extended formulations in mixed-integer convex programming;popular edges and dominant matchings;semidefinite and linear programming integrality gaps for scheduling identical machines;stabilizing network bargaining games by blocking players;round-robin tournaments generated by the circle method have maximum carry-over;extreme functions with an arbitrary number of slopes;minimal cut-generating functions are nearly extreme;on the mixed binary representability of ellipsoidal regions;constant factor approximation for ATSP with two edge weights;improved approximation algorithms for hitting 3-vertex paths;improved approximations for cubic bipartite and cubic TSP;valid inequalities for separable concave constraints with indicator variables;a polyhedral approach to online bipartite matching;robust monotone submodular function maximization;maximizing monotone submodular functions over the integer lattice;submodular unsplittable flow on trees;strong reductions for extended formulations;sum-of-squares hierarchy lower bounds for symmetric formulations;approximation-friendly discrepancy rounding and on the quantile cut closure of chance-constrained problems.
the proceedings contain 33 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: A Better-than-1.6-Approximation for Prize-Collecting TSP;on Ma...
ISBN:
(纸本)9783031598340
the proceedings contain 33 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: A Better-than-1.6-Approximation for Prize-Collecting TSP;on Matrices over a Polynomial Ring with Restricted Subdeterminants;a First Order Method for Linear programming Parameterized by Circuit Imbalance;approximately Packing Dijoins via Nowhere-Zero Flows;capacitated Facility Location with Outliers and Uniform Facility Costs;integer Points in Arbitrary Convex Cones: the Case of the PSD and SOC Cones;the Extension Complexity of Polytopes with Bounded Integral Slack Matrices;assortment optimization with Visibility Constraints;adaptivity Gaps in Two-Sided Assortment optimization;two-Stage Stochastic Stable Matching;von Neumann-Morgenstern Stability and Internal Closedness in Matching theory;fully-Dynamic Load Balancing;pairwise-Independent Contention Resolution;An FPTAS for Connectivity Interdiction;tight Lower Bounds for Block-Structured integer Programs;A Lower Bound for the Max Entropy Algorithm for TSP;on the Number of Degenerate Simplex Pivots;on the Partial Convexification of the Low-Rank Spectral optimization: Rank Bounds and Algorithms;on the Congruency-Constrained Matroid Base;online combinatorial Assignment in Independence Systems;decomposing Probability Marginals Beyond Affine Requirements;polynomial Algorithms to Minimize 2/3-Submodular Functions;A 43-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs;extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families;network Flow Problems with Electric Vehicles;lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack;relaxation Strength for Multilinear optimization: McCormick Strikes Back;online Algorithms for Spectral Hypergraph Sparsification;fast combinatorial Algorithms for Efficient Sortation;a New Branching Rule for Range Minimization Problems;sensitivity Analysis for Mixed Binary Quadrat
the proceedings contain 34 papers. the topics discussed include: a strongly polynomial time algorithm for multicriteria global minimum cuts;integer programs with prescribed number of solutions and a weighted version o...
ISBN:
(纸本)9783319075563
the proceedings contain 34 papers. the topics discussed include: a strongly polynomial time algorithm for multicriteria global minimum cuts;integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem;sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints;maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs;n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem;the triangle splitting method for biobjective mixed integerprogramming;box-constrained mixed-integer polynomial optimization using separable underestimators;the all-or-nothing flow problem in directed graphs with symmetric demand pairs;and strong LP formulations for scheduling splittable jobs on unrelated machines.
the proceedings contain 36 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: Approximating minimum feedback sets and multi-cuts in directed grap...
ISBN:
(纸本)9783540594086
the proceedings contain 36 papers. the special focus in this conference is on integerprogramming and combinatorialoptimization. the topics include: Approximating minimum feedback sets and multi-cuts in directed graphs;nonlinear formulations and improved randomized approximation algorithms for multicut problems;separating clique free and bipartition inequalities in polynomial time;the interval order polytope of a digraph;computational study of a family of mixed-integer quadratic programming problems;a minimal algorithm for the bounded knapsack problem;distributed near-optimal matching;the random linear bottleneck assignment problem;on implementing push-relabel method for the maximum flow problem;use of hidden network structure in the set partitioning problem;generalized max flows and augmenting paths;oriented matroid polytopes and polyhedral fans are signable;on combinatorial properties of binary spaces;coverings and delta-coverings;the topological structure of maximal lattice free convex bodies;the Hilbert basis of the cut cone over the complete graph K6;scheduling jobs of equal length;computational results;formulating a scheduling problem with almost identical jobs by using positional completion times;scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds;a Mickey-mouse decomposition theorem;the series-parallel case;embedding graphs in the torus in linear time;a characterization of seymour graphs;the Markov chain of colourings;how to make a strongly connected digraph two-connected;polyhedra and optimization in connection with a weak majorization ordering and combining and strengthening gomory cuts.
暂无评论