A hybrid algorithm for the unbounded knapsack problemA branch-and-cut approach to the crossing number problemAn algorithm to increase the node-connectivity of a digraph by oneOn the high multiplicity traveling salesman problemGraph-based data clustering with overlapsSpecial Issue on Parameterized Complexity of Discrete OptimizationA polynomial time equivalence between DNA sequencing and the exact perfect matching problemClique partitioning with value-monotone submodular costQuantitative stability analysis for vector problems of 0–1 programmingThe vertex k-cut problemExact weighted vertex coloring via branch-and-priceA new separation algorithm for the Boolean quadric and cut polytopesExploiting planarity in separation routines for the symmetric traveling salesman problemMixed integer programmingValid inequalities for a single constrained 0-1 MIP set intersected with a conflict graphValid inequalities for the single arc design problem with set-upsDescription of 2-integer continuous knapsack polyhedraUniform and most uniform partitions of treesReliability problems in multiple path-shaped facility location on networksA branch-and-cut algorithm for the capacitated profitable tour problemThe two-dimensional bin packing problem with variable bin sizes and costsGrundy dominating sequences and zero forcing setsExact algorithms for the bin packing problem with fragile objectsA max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)ε -optimization schemes and L -bit precision: Alternative perspectives for solving combinatorial optimization problemsA dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problemImproved bounds for vehicle routing solutionsThe complexity of probabilistic lobbyingComparisons and enhancement strategies for linearizing mixed 0-1 quadratic programsFinding well-balanced pairs of edge-disjoint trees in edge-weighted graphsComputing Steiner points for gradient-constrained minimum networksAn integer optimality condition for column generation on zero–one linear programsThe node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation
P1433
Q56050292-13E7DEFC-D260-4450-9CB4-082060DD3338Q56977220-F77ECDEE-E5F8-4B91-8741-CB17165068FBQ56987172-9EB8EBAB-9605-4533-A4B8-6CCB2263133CQ57338958-5DBC50BF-7455-4A01-B296-446BC8F08417Q57359689-1A9127B6-D74B-47FF-975E-75B18D01BA12Q57359716-8B9E0A9D-4F30-49BD-B7BF-1FE13DA2A6A8Q57387753-E733F3D5-472F-4125-B40B-9AAC5EBD8C60Q57399730-F70ACB2C-EE0E-4903-A013-4A02D05A16AFQ57594128-BB4F1108-FD52-44C6-8684-E0E87574333FQ57658998-715A692C-5FAE-4284-8C9F-7D377E28A498Q57659080-716880BD-CADD-43FA-91A2-0C6DB71C2F15Q57702137-8A4F4F77-C4CC-4B76-A950-1A8D6EC94754Q57702249-AE3721D9-5093-42E2-BFB1-08554DDDFB23Q57702297-85CB5416-1296-4F91-8689-76BCF16E46C4Q57736482-8F8E52DA-163B-4C23-B10D-157B6113486FQ57736525-36C04BB8-FC72-4737-91D7-063C160B8750Q57736616-8905DC0E-ACEC-456A-BF57-7EF31E26FE25Q58217117-3BEA4837-E7E2-4A5E-A48D-04466B71BCEFQ58217141-9B211396-2FD6-4248-9A12-25C2544EE1FAQ58826343-03A79184-65D5-44EF-BA1A-B26720C2BEFEQ58826451-0F22CB10-661B-43AE-8518-76B5DADB3BC9Q59072360-3D45B776-C187-434E-A2C4-D965BE96FB89Q59222247-7DBEDA63-E5F8-4CC7-8C6A-A93A3BD8318AQ59560585-CBB0B911-F3A6-433F-9870-82235A806B47Q59592399-5D224EA4-6298-45B4-B4CD-3B12E25A4AF0Q59592442-300B96E7-68B9-4C04-BF0F-6B454B2BF909Q59592457-EBCBE58B-3BE0-4E9F-B493-D7AB68CA20F5Q59864911-138755F2-ED9E-45FA-AD02-FD665E6A43DBQ60395652-E62704B7-6931-44F5-AC71-BC335C0A47A1Q60554471-D3C67658-6D0F-4E39-977D-5896D54D7F88Q61714619-27613B6F-BB40-4CDE-9404-60D98F9B2015Q61940968-0DEC5406-B15A-4AE3-83EC-30904A95EB86Q65553924-D5191F77-67B6-4B5E-B076-8F614A422E6C
P1433
description
journal
@en
periodiek van uitgeverij Elsevier
@nl
مجلة
@ar
name
Discrete Optimization
@da
Discrete Optimization
@en
Discrete Optimization
@fi
Discrete Optimization
@fr
Discrete Optimization
@nb
Discrete Optimization
@nl
Discrete Optimization
@nn
Discrete Optimization
@sv
type
label
Discrete Optimization
@da
Discrete Optimization
@en
Discrete Optimization
@fi
Discrete Optimization
@fr
Discrete Optimization
@nb
Discrete Optimization
@nl
Discrete Optimization
@nn
Discrete Optimization
@sv
prefLabel
Discrete Optimization
@da
Discrete Optimization
@en
Discrete Optimization
@fi
Discrete Optimization
@fr
Discrete Optimization
@nb
Discrete Optimization
@nl
Discrete Optimization
@nn
Discrete Optimization
@sv
P1058
P1156
P123
P1277
P1476
Discrete Optimization
@en
P236
P31
P5963
discrete-optimization