A quadratic simplex algorithm for primal optimization over zero-one polytopes

A primal quadratic simplex algorithm tailored to the optimization over the vertices of a polytope is presented. Starting from a feasible vertex, it performs either strictly improving or admissible non-deteriorating steps in order to determine a locally optimum basic feasible solution in terms of the...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 347; pp. 285 - 296
Main Author: Mallach, Sven
Format: Journal Article
Language:English
Published: Elsevier B.V 15.04.2024
Subjects:
Binary quadratic programming
Linearly-constrained quadratic programming
Simplex algorithm
Simplex algorithm
Linearly-constrained quadratic programming
Binary quadratic programming
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A primal quadratic simplex algorithm tailored to the optimization over the vertices of a polytope is presented. Starting from a feasible vertex, it performs either strictly improving or admissible non-deteriorating steps in order to determine a locally optimum basic feasible solution in terms of the quadratic objective function. The algorithm so generalizes over local improvement methods for according applications, including in particular quadratic optimization problems whose feasible solutions correspond to vertices of a 0-1 polytope. Computational experiments for unconstrained binary quadratic programs, maximum cut, and the quadratic assignment problem serve as a proof of concept and underline the importance of a pivoting rule that is able to accept at least a restricted class of degenerate steps.
AbstractList A primal quadratic simplex algorithm tailored to the optimization over the vertices of a polytope is presented. Starting from a feasible vertex, it performs either strictly improving or admissible non-deteriorating steps in order to determine a locally optimum basic feasible solution in terms of the quadratic objective function. The algorithm so generalizes over local improvement methods for according applications, including in particular quadratic optimization problems whose feasible solutions correspond to vertices of a 0-1 polytope. Computational experiments for unconstrained binary quadratic programs, maximum cut, and the quadratic assignment problem serve as a proof of concept and underline the importance of a pivoting rule that is able to accept at least a restricted class of degenerate steps.
Author Mallach, Sven
Author_xml – sequence: 1
  givenname: Sven
  surname: Mallach
  fullname: Mallach, Sven
  email: smallach@cs.uni-bonn.de
  organization: High Performance Computing & Analytics Lab, University of Bonn, Friedrich-Hirzebruch Allee 8, 53115 Bonn, Germany
BookMark eNp9kM1KAzEUhYNUsFYfwF1eYMbczD-uSvEPKm66cBcyyY2mzEzGZCy2T29qXbu6XDjf4fBdktngBiTkBlgKDMrbbapln3LGsxR4yjJ2RuZQVzwpqwpmZB4zZcKhfrsglyFsGWMQvzl5WdLPL6m9nKyiwfZjh99Udu_O2-mjp8Z5Onrby466cbK9PcSgG6jboacH9C6JM-jouv3kRgxX5NzILuD1312QzcP9ZvWUrF8fn1fLdaJ43kwJFiY3jdG1MW0BVYFNhdBim6mam7yQCFmdY1tXOqu4Mah4VshWlg1IrQ3LFgROtcq7EDwa8bvR7wUwcdQhtiLqEEcdAriIOiJzd2Iw7tpZ9CIoi4NCbT2qSWhn_6F_AOxGbLc
Cites_doi 10.1016/0024-3795(79)90018-1
10.1137/0110022
10.1023/A:1019758821507
10.1287/mnsc.17.11.698
10.1007/BF01580136
10.1287/moor.2.2.103
10.1016/0167-6377(92)90043-3
10.1016/S0167-8191(05)80147-4
10.1007/s10107-003-0384-8
10.1137/S1052623400382467
10.1023/A:1017912624016
10.2307/1909468
10.1007/s12532-014-0075-x
10.1093/imanum/11.3.299
10.1137/0120019
10.1137/0220004
10.1002/nav.3800060305
10.1287/ijoc.2017.0798
10.1016/0167-6377(88)90049-1
10.1145/227683.227684
10.1287/mnsc.44.3.336
10.2307/3007121
10.1287/opre.11.2.248
10.1287/mnsc.9.4.586
10.1007/s10107-008-0235-8
ContentType Journal Article
Copyright 2024 Elsevier B.V.
Copyright_xml – notice: 2024 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.dam.2023.12.030
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 296
ExternalDocumentID 10_1016_j_dam_2023_12_030
S0166218X24000118
GroupedDBID -~X
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
ID FETCH-LOGICAL-c249t-e5f4f9fd8ffb5175e97e1beb3c82f45ae1384eb87d372ffec235aba691addf03
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001171167500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Sat Nov 29 07:24:33 EST 2025
Sat Mar 02 16:01:11 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Simplex algorithm
Linearly-constrained quadratic programming
Binary quadratic programming
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c249t-e5f4f9fd8ffb5175e97e1beb3c82f45ae1384eb87d372ffec235aba691addf03
PageCount 12
ParticipantIDs crossref_primary_10_1016_j_dam_2023_12_030
elsevier_sciencedirect_doi_10_1016_j_dam_2023_12_030
PublicationCentury 2000
PublicationDate 2024-04-15
PublicationDateYYYYMMDD 2024-04-15
PublicationDate_xml – month: 04
  year: 2024
  text: 2024-04-15
  day: 15
PublicationDecade 2020
PublicationTitle Discrete Applied Mathematics
PublicationYear 2024
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Murthy, Li, Pardalos (b20) 1992; 3
Thompson (b32) 2002; 22
Burkard, Çela, Karisch, Rendl, Anjos, Hahn (b5) 2022
Beale (b2) 1959; 6
Goemans, Williamson (b14) 1995; 42
Gilmore (b12) 1962; 10
Giles, Pulleyblank (b10) 1979; 25
Dunning, Gupta, Silberholz (b8) 2018; 30
Pardalos, Schnitger (b25) 1988; 7
Haus, Köppe, Weismantel (b16) 2003; 96
Keller (b17) 1973; 5
Eaves (b9) 1971; 17
Glover, Kochenberger, Alidaee (b13) 1998; 44
Nocedal, Wright (b21) 2006
Dantzig (b6) 1961
Pardalos, Rendl, Wolkowicz (b24) 1994; vol. 16
Shetty (b30) 1963; 11
Bland (b3) 1977; 2
Gould (b15) 1991; 11
Taillard (b31) 1991; 17
Wolfe (b33) 1959; 27
Merz, Freisleben (b19) 2002; 8
Barankin, Dorfman (b1) 1958; vol. 2
van de Panne, Whinston (b22) 1964; 15
Rusin (b28) 1971; 20
Lawler (b18) 1963; 9
Schäffer, Yannakakis (b29) 1991; 20
Rendl, Rinaldi, Wiegele (b26) 2010; 121
Burer, Monteiro, Zhang (b4) 2002; 12
Gill, Wong (b11) 2015; 7
Dantzig (b7) 1963
Pardalos, Jha (b23) 1992; 11
Resende, Ribeiro (b27) 2003
Dantzig (10.1016/j.dam.2023.12.030_b7) 1963
Gould (10.1016/j.dam.2023.12.030_b15) 1991; 11
Pardalos (10.1016/j.dam.2023.12.030_b25) 1988; 7
Eaves (10.1016/j.dam.2023.12.030_b9) 1971; 17
Taillard (10.1016/j.dam.2023.12.030_b31) 1991; 17
Burkard (10.1016/j.dam.2023.12.030_b5) 2022
Barankin (10.1016/j.dam.2023.12.030_b1) 1958; vol. 2
Glover (10.1016/j.dam.2023.12.030_b13) 1998; 44
Goemans (10.1016/j.dam.2023.12.030_b14) 1995; 42
Burer (10.1016/j.dam.2023.12.030_b4) 2002; 12
Pardalos (10.1016/j.dam.2023.12.030_b23) 1992; 11
Bland (10.1016/j.dam.2023.12.030_b3) 1977; 2
Rendl (10.1016/j.dam.2023.12.030_b26) 2010; 121
Pardalos (10.1016/j.dam.2023.12.030_b24) 1994; vol. 16
Keller (10.1016/j.dam.2023.12.030_b17) 1973; 5
Dantzig (10.1016/j.dam.2023.12.030_b6) 1961
Dunning (10.1016/j.dam.2023.12.030_b8) 2018; 30
Resende (10.1016/j.dam.2023.12.030_b27) 2003
Rusin (10.1016/j.dam.2023.12.030_b28) 1971; 20
Wolfe (10.1016/j.dam.2023.12.030_b33) 1959; 27
Haus (10.1016/j.dam.2023.12.030_b16) 2003; 96
Schäffer (10.1016/j.dam.2023.12.030_b29) 1991; 20
Beale (10.1016/j.dam.2023.12.030_b2) 1959; 6
Nocedal (10.1016/j.dam.2023.12.030_b21) 2006
Gilmore (10.1016/j.dam.2023.12.030_b12) 1962; 10
Lawler (10.1016/j.dam.2023.12.030_b18) 1963; 9
Murthy (10.1016/j.dam.2023.12.030_b20) 1992; 3
van de Panne (10.1016/j.dam.2023.12.030_b22) 1964; 15
Shetty (10.1016/j.dam.2023.12.030_b30) 1963; 11
Thompson (10.1016/j.dam.2023.12.030_b32) 2002; 22
Giles (10.1016/j.dam.2023.12.030_b10) 1979; 25
Gill (10.1016/j.dam.2023.12.030_b11) 2015; 7
Merz (10.1016/j.dam.2023.12.030_b19) 2002; 8
References_xml – volume: 12
  start-page: 503
  year: 2002
  end-page: 521
  ident: b4
  article-title: Rank-Two relaxation heuristics for MAX-CUT and other binary quadratic programs
  publication-title: SIAM J. Optim.
– volume: 10
  start-page: 305
  year: 1962
  end-page: 313
  ident: b12
  article-title: Optimal and suboptimal algorithms for the quadratic assignment problem
  publication-title: J. Soc. Ind. Appl. Math.
– volume: 44
  start-page: 336
  year: 1998
  end-page: 345
  ident: b13
  article-title: Adaptive memory tabu search for binary quadratic programs
  publication-title: Manage. Sci.
– year: 2006
  ident: b21
  article-title: Numerical Optimization
– volume: 6
  start-page: 227
  year: 1959
  end-page: 243
  ident: b2
  article-title: On quadratic proramming
  publication-title: Nav. Res. Logist. Q.
– volume: vol. 2
  year: 1958
  ident: b1
  publication-title: On Quadratic Programming
– volume: 7
  start-page: 33
  year: 1988
  end-page: 35
  ident: b25
  article-title: Checking local optimality in constrained quadratic programming is NP-hard
  publication-title: Oper. Res. Lett.
– volume: 25
  start-page: 191
  year: 1979
  end-page: 196
  ident: b10
  article-title: Total dual integrality and integer polyhedra
  publication-title: Linear Algebra Appl.
– volume: 27
  start-page: 382
  year: 1959
  end-page: 398
  ident: b33
  article-title: The simplex method for quadratic programming
  publication-title: Econometrica
– volume: 20
  start-page: 143
  year: 1971
  end-page: 160
  ident: b28
  article-title: A revised simplex method for quadratic programming
  publication-title: SIAM J. Appl. Math.
– volume: 8
  start-page: 197
  year: 2002
  end-page: 213
  ident: b19
  article-title: Greedy and local search heuristics for unconstrained binary quadratic programming
  publication-title: J. Heuristics
– volume: vol. 16
  start-page: 1
  year: 1994
  end-page: 42
  ident: b24
  article-title: The quadratic assignment problem: A survey and recent developments
  publication-title: Quadratic Assignment and Related Problems
– volume: 20
  start-page: 56
  year: 1991
  end-page: 87
  ident: b29
  article-title: Simple local search problems that are hard to solve
  publication-title: SIAM J. Comput.
– volume: 42
  start-page: 1115
  year: 1995
  end-page: 1145
  ident: b14
  article-title: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  publication-title: J. ACM
– volume: 5
  start-page: 311
  year: 1973
  end-page: 337
  ident: b17
  article-title: The general quadratic optimization problem
  publication-title: Math. Program.
– volume: 9
  start-page: 586
  year: 1963
  end-page: 599
  ident: b18
  article-title: The quadratic assignment problem
  publication-title: Manage. Sci.
– volume: 22
  start-page: 351
  year: 2002
  end-page: 367
  ident: b32
  article-title: An integral simplex algorithm for solving combinatorial optimization problems
  publication-title: Comput. Optim. Appl.
– volume: 3
  start-page: 524
  year: 1992
  end-page: 538
  ident: b20
  article-title: A local search algorithm for the quadratic assignment problem
  publication-title: Informatica
– start-page: 219
  year: 2003
  end-page: 249
  ident: b27
  article-title: Greedy randomized adaptive search procedures
  publication-title: Handbook of Metaheuristics
– volume: 11
  start-page: 248
  year: 1963
  end-page: 260
  ident: b30
  article-title: A simplified procedure for quadratic programming
  publication-title: Oper. Res.
– volume: 2
  start-page: 103
  year: 1977
  end-page: 107
  ident: b3
  article-title: New finite pivoting rules for the simplex method
  publication-title: Math. Oper. Res.
– volume: 96
  start-page: 205
  year: 2003
  end-page: 246
  ident: b16
  article-title: A primal all-integer algorithm based on irreducible solutions
  publication-title: Math. Program.
– volume: 15
  start-page: 355
  year: 1964
  end-page: 388
  ident: b22
  article-title: The simplex and the dual method for quadratic programming
  publication-title: OR
– volume: 11
  start-page: 119
  year: 1992
  end-page: 123
  ident: b23
  article-title: Complexity of uniqueness and local search in quadratic 0–1 programming
  publication-title: Oper. Res. Lett.
– volume: 7
  start-page: 71
  year: 2015
  end-page: 112
  ident: b11
  article-title: Methods for convex and general quadratic programming
  publication-title: Math. Program. Comput.
– year: 1961
  ident: b6
  article-title: Quadratic Programming. A Variant of the Wolfe-Markowitz Algorithms
– volume: 30
  start-page: 608
  year: 2018
  end-page: 624
  ident: b8
  article-title: What works best when? A systematic evaluation of heuristics for max-cut and QUBO
  publication-title: INFORMS J. Comput.
– volume: 17
  start-page: 698
  year: 1971
  end-page: 711
  ident: b9
  article-title: On quadratic programming
  publication-title: Manage. Sci.
– volume: 121
  start-page: 307
  year: 2010
  end-page: 335
  ident: b26
  article-title: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations
  publication-title: Math. Program.
– year: 2022
  ident: b5
  article-title: QAPLIB – A Quadratic Assignment Problem Library - Problem instances and solutions
– year: 1963
  ident: b7
  article-title: Linear Programming and Extensions
– volume: 17
  start-page: 443
  year: 1991
  end-page: 455
  ident: b31
  article-title: Robust taboo search for the quadratic assignment problem
  publication-title: Parallel Comput.
– volume: 11
  start-page: 299
  year: 1991
  end-page: 324
  ident: b15
  article-title: An algorithm for large-scale quadratic programming
  publication-title: IMA J. Numer. Anal.
– volume: 25
  start-page: 191
  year: 1979
  ident: 10.1016/j.dam.2023.12.030_b10
  article-title: Total dual integrality and integer polyhedra
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(79)90018-1
– year: 1963
  ident: 10.1016/j.dam.2023.12.030_b7
– volume: vol. 2
  year: 1958
  ident: 10.1016/j.dam.2023.12.030_b1
– volume: 10
  start-page: 305
  issue: 2
  year: 1962
  ident: 10.1016/j.dam.2023.12.030_b12
  article-title: Optimal and suboptimal algorithms for the quadratic assignment problem
  publication-title: J. Soc. Ind. Appl. Math.
  doi: 10.1137/0110022
– volume: 22
  start-page: 351
  issue: 3
  year: 2002
  ident: 10.1016/j.dam.2023.12.030_b32
  article-title: An integral simplex algorithm for solving combinatorial optimization problems
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/A:1019758821507
– volume: 3
  start-page: 524
  year: 1992
  ident: 10.1016/j.dam.2023.12.030_b20
  article-title: A local search algorithm for the quadratic assignment problem
  publication-title: Informatica
– volume: 17
  start-page: 698
  issue: 11
  year: 1971
  ident: 10.1016/j.dam.2023.12.030_b9
  article-title: On quadratic programming
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.17.11.698
– volume: 5
  start-page: 311
  issue: 1
  year: 1973
  ident: 10.1016/j.dam.2023.12.030_b17
  article-title: The general quadratic optimization problem
  publication-title: Math. Program.
  doi: 10.1007/BF01580136
– volume: vol. 16
  start-page: 1
  year: 1994
  ident: 10.1016/j.dam.2023.12.030_b24
  article-title: The quadratic assignment problem: A survey and recent developments
– volume: 2
  start-page: 103
  issue: 2
  year: 1977
  ident: 10.1016/j.dam.2023.12.030_b3
  article-title: New finite pivoting rules for the simplex method
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2.2.103
– year: 1961
  ident: 10.1016/j.dam.2023.12.030_b6
– volume: 11
  start-page: 119
  issue: 2
  year: 1992
  ident: 10.1016/j.dam.2023.12.030_b23
  article-title: Complexity of uniqueness and local search in quadratic 0–1 programming
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(92)90043-3
– year: 2022
  ident: 10.1016/j.dam.2023.12.030_b5
– volume: 17
  start-page: 443
  issue: 4
  year: 1991
  ident: 10.1016/j.dam.2023.12.030_b31
  article-title: Robust taboo search for the quadratic assignment problem
  publication-title: Parallel Comput.
  doi: 10.1016/S0167-8191(05)80147-4
– volume: 96
  start-page: 205
  issue: 2
  year: 2003
  ident: 10.1016/j.dam.2023.12.030_b16
  article-title: A primal all-integer algorithm based on irreducible solutions
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0384-8
– volume: 12
  start-page: 503
  issue: 2
  year: 2002
  ident: 10.1016/j.dam.2023.12.030_b4
  article-title: Rank-Two relaxation heuristics for MAX-CUT and other binary quadratic programs
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623400382467
– volume: 8
  start-page: 197
  issue: 2
  year: 2002
  ident: 10.1016/j.dam.2023.12.030_b19
  article-title: Greedy and local search heuristics for unconstrained binary quadratic programming
  publication-title: J. Heuristics
  doi: 10.1023/A:1017912624016
– volume: 27
  start-page: 382
  issue: 3
  year: 1959
  ident: 10.1016/j.dam.2023.12.030_b33
  article-title: The simplex method for quadratic programming
  publication-title: Econometrica
  doi: 10.2307/1909468
– volume: 7
  start-page: 71
  issue: 1
  year: 2015
  ident: 10.1016/j.dam.2023.12.030_b11
  article-title: Methods for convex and general quadratic programming
  publication-title: Math. Program. Comput.
  doi: 10.1007/s12532-014-0075-x
– volume: 11
  start-page: 299
  issue: 3
  year: 1991
  ident: 10.1016/j.dam.2023.12.030_b15
  article-title: An algorithm for large-scale quadratic programming
  publication-title: IMA J. Numer. Anal.
  doi: 10.1093/imanum/11.3.299
– volume: 20
  start-page: 143
  issue: 2
  year: 1971
  ident: 10.1016/j.dam.2023.12.030_b28
  article-title: A revised simplex method for quadratic programming
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0120019
– volume: 20
  start-page: 56
  issue: 1
  year: 1991
  ident: 10.1016/j.dam.2023.12.030_b29
  article-title: Simple local search problems that are hard to solve
  publication-title: SIAM J. Comput.
  doi: 10.1137/0220004
– volume: 6
  start-page: 227
  issue: 3
  year: 1959
  ident: 10.1016/j.dam.2023.12.030_b2
  article-title: On quadratic proramming
  publication-title: Nav. Res. Logist. Q.
  doi: 10.1002/nav.3800060305
– volume: 30
  start-page: 608
  issue: 3
  year: 2018
  ident: 10.1016/j.dam.2023.12.030_b8
  article-title: What works best when? A systematic evaluation of heuristics for max-cut and QUBO
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.2017.0798
– volume: 7
  start-page: 33
  issue: 1
  year: 1988
  ident: 10.1016/j.dam.2023.12.030_b25
  article-title: Checking local optimality in constrained quadratic programming is NP-hard
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(88)90049-1
– volume: 42
  start-page: 1115
  issue: 6
  year: 1995
  ident: 10.1016/j.dam.2023.12.030_b14
  article-title: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  publication-title: J. ACM
  doi: 10.1145/227683.227684
– start-page: 219
  year: 2003
  ident: 10.1016/j.dam.2023.12.030_b27
  article-title: Greedy randomized adaptive search procedures
– volume: 44
  start-page: 336
  issue: 3
  year: 1998
  ident: 10.1016/j.dam.2023.12.030_b13
  article-title: Adaptive memory tabu search for binary quadratic programs
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.44.3.336
– volume: 15
  start-page: 355
  issue: 4
  year: 1964
  ident: 10.1016/j.dam.2023.12.030_b22
  article-title: The simplex and the dual method for quadratic programming
  publication-title: OR
  doi: 10.2307/3007121
– volume: 11
  start-page: 248
  issue: 2
  year: 1963
  ident: 10.1016/j.dam.2023.12.030_b30
  article-title: A simplified procedure for quadratic programming
  publication-title: Oper. Res.
  doi: 10.1287/opre.11.2.248
– volume: 9
  start-page: 586
  issue: 4
  year: 1963
  ident: 10.1016/j.dam.2023.12.030_b18
  article-title: The quadratic assignment problem
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.9.4.586
– volume: 121
  start-page: 307
  issue: 2
  year: 2010
  ident: 10.1016/j.dam.2023.12.030_b26
  article-title: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations
  publication-title: Math. Program.
  doi: 10.1007/s10107-008-0235-8
– year: 2006
  ident: 10.1016/j.dam.2023.12.030_b21
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.381885
Snippet A primal quadratic simplex algorithm tailored to the optimization over the vertices of a polytope is presented. Starting from a feasible vertex, it performs...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 285
SubjectTerms Binary quadratic programming
Linearly-constrained quadratic programming
Simplex algorithm
Title A quadratic simplex algorithm for primal optimization over zero-one polytopes
URI https://dx.doi.org/10.1016/j.dam.2023.12.030
Volume 347
WOSCitedRecordID wos001171167500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20211211
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20220331
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS-wwFA46utCF-LhyfZKFK4fAtGmnyXLwgQojgrOYXUnb5N4RnZZOr4z-ek8erfUF14VdlFJo0uYLJ19PzvkOQkdhKKnKQkZEv5cQLflGeMAZCaRKgcwB5rJnik1E19dsPOY3rnDhzJQTiKZTNp_z4kehhnsAtk6d_QbcTaNwA64BdDgD7HD-L-AHOlEyK40S62yixX_nXXH_Jy8n1d8HE1VYaIUJ4KBgLR5cGmZXR3J2n2WZkxxoZ5HfP1V54eILHXc9nYCJAY7dMNdhI_naEPOh8csbV83to8sycz4F34Si2KzK2s3Y7xNY_MdtO0mtNGZt6WylHbdo-rYs7Qd7bF0Dd9CTzvr3qXG9uo2YN9rX79akJlKwDkK7i6GJWDcRe34MTSyiJT8KOeugpcHl2fiqpRmmBfFWai_b66YSkKvASb3bj6s3uU2437s3_JymtKjHaB2tuX8GPLBYb6AFOd1Eq63R30LDAW5Qxw513KCOAXVsUcdt1LFGHdeo4wb1X2h0fjY6uSCuUgZJ4fe5IjJUgeIqY0olIRBCySPpJTKhKfNVEArpURbIhEUZjXwdJ-TTUCSizz1Y3lSPbqPOFPr5jbDHuGDwVCqkCODgKhIeS3mWMeqlnthBx_W4xIXVQ4m_xGgHBfXIxY7QWaIWw_z4-rHd7_Sxh1ZeZ_A-6lTlP3mAltPHajIrD93keAHA4WsT
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+quadratic+simplex+algorithm+for+primal+optimization+over+zero-one+polytopes&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Mallach%2C+Sven&rft.date=2024-04-15&rft.issn=0166-218X&rft.volume=347&rft.spage=285&rft.epage=296&rft_id=info:doi/10.1016%2Fj.dam.2023.12.030&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2023_12_030
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon